In Web we trust: establishing strategic trust among online customers - Ceaparu,I.; Demner,D.; Hung,E.; Zhao,H.; Shneiderman, Ben (E-Service: new directions in theory and practice, 2002)
Electronic commerce (e-commerce) provides an important chance for established large companies to gain more customers as well as for new small companies to have a good start and rapid growth. However, establishing trust between customers and companies through web interface, a key component of successful e-service, is not as easy as through human-buyer-human-seller interaction. In the past few years, a number of experiments have been conducted in order to determine the factors that influence customers' trust in online businesses. The goal of our experiment was to establish which features that appear on commercial websites are trust-inducing. Our study focused on three independent variables: customer service (limited and extensive), testimonial (self and external) and security features representation (graphics and text). We designed the homepages of eight web sites with all combinations of treatments of the three independent variables. Each of the 52 subjects reviewed all the eight homepages and gave them a relative rank of trustworthiness. After the experiment subjects answered additional e-trust related questions. The experiment results and the survey support the belief that specific customer service commitments, third party testimonials and graphic security representations are important in establishing strategic trust among on-line customers.

Interactive, Incremental Scheduling for Virtual Telescopes in Education - Rathod,Priyang; desJardins, Marie; Sansare,Suryakant (THIRD INTERNATIONAL NASA WORKSHOP ON PLANNING AND SCHEDULING FOR SPACE, 2002)
The Telescopes in Education (TIE) project, which began in 1992, provides remote access for students to control large observatory telescopes in real time. TIE began with a single telescope, and with manual evaluation and scheduling of student requests. With the sucess of TIE, 20 or more additional telescopes are expected to come on line. With proportionally more student requests, we anticipate that managing the requests and telescope resources will rapidly become too complex and time-consuming to handle manually. To respond to this problem, the Virtual Telescopes in Education (VTIE) project was begun last year. VTIE will provide networked capabilities for automated proposal preparation and evaluation, scheduling, and data archival. This paper describes the interactive scheduling capability that is under development for VTIE. Accepted observation requests will be incrementally and interactively scheduled by a constraint-based scheduler, and rescheduled as needed in response to dynamically changing weather and telescope conditions. The scheduling system incorporates a novel method for cost-sensitive constraint satisfaction, which will enable modeling of the costs of data gathering and user interaction during schedule repair.

Interlingua approximation: A generation-heavy approach - Dorr, Bonnie J; Habash,N. (Proceedings of AMTA-2002, 2002)

Irisnet: An architecture for compute-intensive wide-area sensor network services - Nath,S.; Deshpande, Amol; Ke,Y.; Gibbons,P.; Karp,B.; Seshan,S. (Intel Corporation, Pittsburgh IRPTR-02, 2002)
Previous work on sensor networks has targeted adhoc wireless networks of closely-colocated, resource- constrained scalar sensor motes. Such work has over- looked richer sensor types such as webcams and mi- crophones, which are typically attached to Internet- connected machines with significant computing power and storage. In this paper, we describe IrisNet (Internet- scale Resource-Intensive Sensor Network services), an architecture for wide-area sensor networks based on these more capable sensing nodes. IrisNet provides a common, scalable software infrastructure that enables the flexible creation of sensor-based Internet services. It dramatically reduces network bandwidth utilization through the use of senselets, binary code fragments that perform intensive data filtering at the sensing nodes, leveraging the available processing power and mem- ory. IrisNet employs a two-tier hierarchy of sensing nodes and query processing nodes. Key features of IrisNet include flexible data partitioning, efficient and protected sharing of sensor nodes, low-latency queries, partial match caching, query-specified freshness toler- ances, and monitoring and logging support. This pa- per reports on experiments with a working IrisNet pro- totype running a parking space finder service, demon- strating the effectiveness of IrisNet’s features in achiev- ing scalability and reducing query response times.

Joint audio-visual tracking using particle filters - Zotkin,Dmitry N; Duraiswami, Ramani; Davis, Larry S. (EURASIP J. Appl. Signal Process., 2002)
It is often advantageous to track objects in a scene using multimodal information when such information is available. We use audio as a complementary modality to video data, which, in comparison to vision, can provide faster localization over a wider field of view. We present a particle-filter based tracking framework for performing multimodal sensor fusion for tracking people in a videoconferencing environment using multiple cameras and multiple microphone arrays. One advantage of our proposed tracker is its ability to seamlessly handle temporary absence of some measurements (e.g., camera occlusion or silence). Another advantage is the possibility of self-calibration of the joint system to compensate for imprecision in the knowledge of array or camera parameters by treating them as containing an unknown statistical component that can be determined using the particle filter framework during tracking. We implement the algorithm in the context of a videoconferencing and meeting recording system. The system also performs high-level semantic analysis of the scene by keeping participant tracks, recognizing turn-taking events and recording an annotated transcript of the meeting. Experimental results are presented. Our system operates in real time and is shown to be robust and reliable.
Keywords: audio-visual tracking; Monte-Carlo algorithms; sensor fusion

Key-insulated public key cryptosystems - Dodis,Y.; Katz, Jonathan; Xu,S.; Yung,M. (Advances in Cryptology—Eurocrypt 2002, 2002)
Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of key-insulated security whose goal is to minimize the damage caused by secret-key exposures. In our model, the secret key(s) stored on the insecure device are refreshed at discrete time periods via inter-action with a physically-secure - but computationally-limited - device which stores a “master key”. All cryptographic computations are still done on the insecure device, and the public key remains unchanged. In a (t, N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods of his choice is unable to violate the security of the cryptosystem for any of the remaining N - t periods. Furthermore, the scheme remains secure (for all time periods) against an adversary who compromises only the physically-secure device. We focus primarily on key-insulated public-key encryption. We construct a (t, N)-key-insulated encryption scheme based on any (standard) public-key encryption scheme, and give a more efficient construction based on the DDH assumption. The latter construction is then extended to achieve chosen-ciphertext security.

Lexicon Acquisition from Bilingual Dictionaries - David Doermann; Ma,H.; Karagol-Ayan,B.; Oard, Douglas (SPIEPhotonic West Electronic Imaging Conference, 2002)

Logical Labeling of Document Images Using Layout Graph Matching with Adaptive Learning - Liang,J.; David Doermann (IAPR Conference on Document Analysis System, 2002)
Logical structure analysis of document images is an important problem in document image understanding. In this paper, we propose a graph matching approach to label logical components on a document page. Our system is able to learn a model for a document class, use this model to label document images through graph matching, and adaptively improve the model with error feed back. We tested our method on journal/proceeding article title pages. The experimental results show promising accuracy, and confirm the ability of adaptive learning.

Multiple scattering from N spheres - Gumerov, Nail A.; Duraiswami, Ramani (Antennas and Propagation Society International Symposium, 2002. IEEE, 2002)

Multiresolution mesh representation: Models and data structures - De Floriani, Leila; Magillo,P. (Tutorials on Multiresolution in Geometric Modelling, 2002)
Multiresolution meshes are a common basis for building representationsof a geometric shape at different levels of detail. The use of the term multiresolu- tion depends on the remark that the accuracy (or, level of detail) of a mesh in approximating a shape is related to the mesh resolution, i.e., to the density (size and number) of its cells. A multiresolution mesh provides several alternative mesh- based approximations of a spatial object (e.g., a surface describing the boundary of a solid object, or the graph of a scalar field). A multiresolution mesh is a collection of mesh fragments, describing usually small portions of a spatial object with different accuracies, plus suitable relations that allow selecting a subset of fragments (according to user-defined accuracy crite- ria), and combining them into a mesh covering the whole object, or an object part. Existing multiresolution models differ in the type of mesh fragments they consider and in the way they define relations among such fragments. In this chapter, we introduce a framework for multiresolution meshes in order to analyze and compare existing models proposed in the literature on a common basis. We have identified two sets of basic queries on a multiresolution meshes, that we call selective refinement and spatial selection. We describe two approaches for answering such queries, and discuss the primitives involved in them, which must be efficiently supported by any data structure implementing a multiresolution mesh. We then describe and analyze data structures proposed in the literature for encoding multiresolution meshes.

Multiresolution tetrahedral meshes: an analysis and a comparison - Danovaro,E.; De Floriani, Leila; Lee,M.; Samet, Hanan (Shape Modeling International, 2002. Proceedings, 2002)
We deal with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented
Keywords: (computer; bisection; vertex; cells; tetrahedron; data; generation; rendering; geometry; data; graphics); solid; meshes; rendering; tetrahedral; modelling; refinement; multiresolution; representations; multiresolution; sets; mesh; split; computational; structures; data; tetrahedral; visualisation; mesh; visualization; experiment; large-size; volume

A new, expressed multigene family containing a hot spot for insertion of retroelements is associated with polymorphic subtelomeric regions of Trypanosoma brucei - Bringaud,F.; Biteau,N.; Melville,S. E.; Hez,S.; El‐Sayed, Najib M.; Leech,V.; Berriman,M.; Hall,N.; Donelson,J. E; Baltz,T. (Eukaryotic cell, 2002)

A noisy-channel model for document compression - Daumé, Hal; Marcu,Daniel (Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, 2002)
We present a document compression system that uses a hierarchical noisy-channel model of text production. Our compression system first automatically derives the syntactic structure of each sentence and the overall discourse structure of the text given as input. The system then uses a statistical hierarchical model of text production in order to drop non-important syntactic and discourse constituents so as to generate coherent, grammatical document compressions of arbitrary length. The system outperforms both a baseline and a sentence-based compression system that operates by simplifying sequentially all sentences in a text. Our results support the claim that discourse knowledge plays an important role in document summarization.

Non-manifold decomposition in arbitrary dimensions - De Floriani, Leila; Mesmoudi,M.; Morando,F.; Puppo,E. (Discrete Geometry for Computer Imagery, 2002)
In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described by an abstract simplicial complex into an assembly of ‘more-regular’ components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because they are not decidable sets. Therefore, we define d-quasi-manifolds, a decidable superset of the class of combinatorial d-manifolds that coincides with d-manifolds in dimension less or equal than two. We first introduce the notion of d-quasi-manifold complexes, then we sketch an algorithm to decompose an arbitrary complex into an assembly of quasi-manifold components abutting at non-manifold joints. This result provides a rigorous starting point for our future work, which includes designing efficient data structures for non-manifold modeling, as well as defining a notion of measure of shape complexity of such models.

Numerical study of the influence of the torso on the HRTF - Gumerov, Nail A.; Duraiswami, Ramani; Tang,Z. (Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on, 2002)

Page classification through logical labelling - Liang,Jian; David Doermann; Ma,M.; Guo,J. K (Pattern Recognition, 2002. Proceedings. 16th International Conference on, 2002)
We propose an integrated approach to page classification and logical labelling. Layout is represented by a fully connected attributed relational graph that is matched to the graph of an unknown document, achieving classification and labelling simultaneously. By incorporating global constraints in an integrated fashion, ambiguity at the zone level can be reduced, providing robustness to noise and variation. Models are automatically trained from sample documents. Experimental results show promise for the classification and labelling of technical article title pages, and supports the idea of a hierarchical model base.
Keywords: article; attributed; base; character; classification; constraints; document; document; experimental; global; graph; graph; hierarchical; image; images; labelling; logical; model; noise; OCR; optical; page; pages; processing; recognition; relational; results; technical; theory; title; unknown

PASSAT: A user-centric planning framework - Myers,K.L.; Tyson,W.M.; Wolverton,M.J.; Jarvis,P.A.; Lee,T.J.; desJardins, Marie (Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for Space, 2002)
We describe a plan-authoring system called PASSAT (Plan-Authoring System based on Sketches, Advice, and Templates) that combines interactive tools for constructing plans with a suite of automated and mixed-initiative capabilities designed to complement human planning skills. PASSAT is organized around a library of predefined templates that encode task networks describing standard operating procedures and previous cases. Users can select from these templates to apply during plan development, with the system providing various forms of automated assistance. A mixed-initiative plan sketch facility helps users refine outlines for plans to complete solutions, by detecting problems and proposing possible fixes. An advice capability enables user specification of high-level guidelines for plans that the system helps to enforce. Finally, PASSAT includes process facilitation mechanisms designed to help a user track and manage outstanding planning tasks and information requirements, as a means of improving the efficiency and effectiveness of the planning process. PASSAT is designed for applications for which a core of planning knowledge can be captured in predefined action models but where significant user control of the planning process is required.

Performance evaluation of object detection algorithms - Mariano,V.Y.; Min,Junghye; Park,Jin-Hyeong; Kasturi,R.; Mihalcik,D.; Huiping Li; David Doermann; Drayer,T. (Pattern Recognition, 2002. Proceedings. 16th International Conference on, 2002)
The continuous development of object detection algorithms is ushering in the need for evaluation tools to quantify algorithm performance. In this paper a set of seven metrics are proposed for quantifying different aspects of a detection algorithm's performance. The strengths and weaknesses of these metrics are described. They are implemented in the Video Performance Evaluation Resource (ViPER) system and will be used to evaluate algorithms for detecting text, faces, moving people and vehicles. Results for running two previous text-detection algorithms on a common data set are presented.
Keywords: algorithms; common; data; DETECTION; detection; Evaluation; evaluation; image; object; performance; recognition; resource; set; system; text-detection; video

Physical Programming: Designing Tools for Children to Create Physical Interactive - Montemayor,J.; Druin, Allison; Farber,A.; Simms,S.; Churaman,W. (Proceedings: SIGCHI, 2002)

Planning in a multi-agent environment: theory and practice - Dix,Jürgen; Muñoz-Avila,Héctor; Nau, Dana S.; Zhang,Lingling (ACM, 2002)
We give the theoretical foundations and empirical evaluation of a planning agent, shop, performing HTN planning in a multi-agent environment. shop is based on A-SHOP, an agentized version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO's. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimizations of such planners. Our main results are: (1) using NEO's as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance in a significant way.
Keywords: agent architectures; agent selection and planning; formalisms and logics

Regular and irregular multi-resolution terrain models: a comparison - De Floriani, Leila; Magillo,Paola (Proceedings of the 10th ACM international symposium on Advances in geographic information systems, 2002)
The paper deals with the problem of modeling large-size terrain data sets. To this aim, we consider multi-resolution models based on triangle meshes. We analyze and compare two multi-resolution terrain models based on regular and irregular meshes. The two models are viewed as instances of a common multi-resolution model, that we call a multi-resolution triangle mesh. Our comparison takes into account the space requirements of the data structures implementing the two models as well their effectiveness in supporting the extraction of variable-resolution terrain representations.
Keywords: Multi-resolution; regular and irregular structures; terrain models

Segmentation and Identification of Handwriting in Noisy Documents - Zheng,Y.; Li,H.; David Doermann (IAPRConference on Document Analysis System, 2002)
In this paper we present an approach to the problem of segmenting and identifying handwritten annotations in noisy document images. In many types of documents such as correspondence, it is not uncommon for handwritten annotations to be added as part of a note, correction, clarification, or instruction, or a signature to appear as an authentication mark. It is important to be able to segment and identify such handwriting so we can 1) locate, interpret and re-trieve them efficiently in large document databases, and 2) use different algo-rithms for printed/handwritten text recognition and signature verification. Our approach consists of two processes: 1) a segmentation process, which divides the text into regions at an appropriate level (character, word, or zone), and 2) a classification process which identifies the segmented regions as handwritten. To determine the approximate region size where classification can be reliably per-formed, we conducted experiments at the character, word and zone level. We found that the reliable results can be achieved at the word level with a classifi-cation accuracy of 97.3%. The identified handwritten text is further grouped into zones and verified to reduce false alarms. Experiments show our approach is promising and robust.

SIGMA: A Simulator Infrastructure to Guide Memory Analysis - DeRose,Luiz; Ekanadham, K.; Hollingsworth, Jeffrey K; Sbaraglia, Simone (SC Conference, 2002)
In this paper we present SIGMA (Simulation Infrastructure to Guide Memory Analysis), a new data collection framework and family of cache analysis tools. The SIGMA environment provides detailed cache information by gathering memory reference data using software-based instrumentation. This infrastructure can facilitate quick probing into the factors that influence the performance of an application by highlighting bottleneck scenarios including: excessive cache/TLB misses and inefficient data layouts. The tool can also assist in perturbation analysis to determine performance variations caused by changes to architecture or program. Our validation tests using the SPEC Swim benchmark show that most of the performance metrics obtained with SIGMA are within 1% of the metrics obtained with hardware performance counters, with the advantage that SIGMA provides performance data on a data structure level, as specified by the programmer.

A Smale-like decomposition for discrete scalar fields - De Floriani, Leila; Mesmoudi,M. M.; Danovaro,E. (Pattern Recognition, 2002. Proceedings. 16th International Conference on, 2002)
In this paper we address the problem of representing the structure of the topology of a d-dimensional scalar field as a basis for constructing a multiresolution representation of the structure of such afield. To this aim, we define a discrete decomposition of a triangulated d-dimensional domain, on whose vertices the values of the field are given. We extend a Smale decomposition, defined by Thom (1949) and Smale (1960) for differentiable functions, to the discrete case, to what we call a Smale-like decomposition. We introduce the notion of discrete gradient vector field, which indicates the growth of the scalar field and matches with our decomposition. We sketch an algorithm for building a Smale-like decomposition and a graph-based representation of this decomposition. We present results for the case of two-dimensional fields.
Keywords: data; decomposition; differentiable; discrete; domain; field; fields; functions; gradient; graph-based; methods; multidimensional; multiresolution; representation; scalar; Smale-like; structure; Topology; triangulated; vector; visualisation

Smiling faces are better for face recognition - Yacoob,Yaser; Davis, Larry S. (Fifth IEEE International Conference on Automatic Face and Gesture Recognition, 2002. Proceedings, 2002)
This paper investigates face recognition during facial expressions. While face expressions have been treated as an adverse factor in standard face recognition approaches, our research suggests that, if a system has a choice in the selection of faces to use in training and recognition, its best performance would be obtained on faces displaying expressions. Naturally, smiling faces are the most prevalent (among expressive faces) for both training and recognition in dynamic scenarios. We employ a measure of discrimination power that is computed from between-class and within-class scatter matrices. Two databases are used to show the performance differences on different sets of faces
Keywords: between-class scatter matrices; Databases; discrimination power measure; dynamic scenarios; expressive faces; face recognition; facial expressions; performance; performance differences; smiling faces; software performance evaluation; Training; visual databases; within-class scatter matrices

A Step Towards Automated Design of Multi-Piece Sacrificial Molds - Dhaliwal,Savinder; Gupta, Satyandra K.; Huang,Jun; Kumar,Malay (ASME, 2002)
This paper describes a feature-based approach for design of multi-piece sacrificial molds. Our mold design algorithm consists of the following three steps. First, the desired gross mold shape is formed based on the feature-based description of the part geometry. Second, if the desired gross mold shape is not machinable as a single piece, the gross mold shape is decomposed into simpler geometric components to make sure that each component is manufacturable using 3-axis CNC machining. The decomposition is performed to ensure that each component is accessible to end-milling tools, and decomposed components can be assembled together to form the gross mold shape. Finally, assembly features are added to mold components to facilitate assembly of mold components and eliminate unnecessary degree of freedoms from the final mold assembly. We expect that our decomposition algorithm will provide a step towards the necessary foundations for automating the design of multi-piece mold and therefore will help in significantly reducing the mold design and manufacturing lead-time.

Strong key-insulated signature schemes - Dodis,Y.; Katz, Jonathan; Xu,S.; Yung,M. (Public Key Cryptography—PKC 2003, 2002)
Signature computation is frequently performed on insecure devices—e.g., mobile phones — operating in an environment where the private (signing)k ey is likely to be exposed. Strong key-insulated signature schemes are one way to mitigate the damage done when this occurs. In the key-insulated model [6], the secret key stored on an insecure device is refreshed at discrete time periods via interaction with a physically-secure device which stores a “master key”. All signing is still done by the insecure device, and the public key remains fixed throughout the lifetime of the protocol. In a strong (t,N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods is unable to forge signatures for any of the remaining N-t periods. Furthermore, the physically-secure device (or an adversary who compromises only this device)is unable to forge signatures for any time period.We present here constructions of strong key-insulated signature schemes based on a variety of assumptions. First, we demonstrate a generic construction of a strong (N— 1,N)-key-insulated signature scheme using any standard signature scheme. We then give a construction of a strong (t,N)-signature scheme whose security may be based on the discrete logarithm assumption in the random oracle model. This construction offers faster signing and verification than the generic construction, at the expense of O(t)k ey update time and key length. Finally, we construct strong (N —1,N)-key-insulated schemes based on any “trapdoor signature scheme” (a notion we introduce here); our resulting construction in fact serves as an identity-based signature scheme as well. This leads to very efficient solutions based on, e.g., the RSA assumption in the random oracle model. Work done in part while at DIMACS.

Technologies for families - Plaisant, Catherine; Druin, Allison; Hutchinson,Hilary (CHI '02 extended abstracts on Human factors in computing systems, 2002)
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

Temporal Color Correlograms in Video Retrieval - Rautiainen,M.; David Doermann (International Conference on Pattern Recognition, 2002)

Term selection for searching printed Arabic - Darwish,Kareem; Oard, Douglas (Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002)
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

Text Quality Estimation in Digital Video - Li,H.; David Doermann (SPIE Conf. on Document Recognition and Information Retrieval, 2002)

Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment - Dix,Jürgen; Munoz-Avila,Hector; Nau, Dana S.; Zhang,Lingling (Logics in Artificial Intelligence, 2002)
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’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’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

Three-dimensional visualization of hierarchical task network plans - Kundu,K.; Sessions,C.; desJardins, Marie; Rheingans,P. (In Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for, 2002)
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.

Trypanosoma cruzi: RNA structure and post-transcriptional control of tubulin gene expression - Bartholomeu,Daniella C.; Silva,Rosiane A.; Galvão,Lucia M. C.; El‐Sayed, Najib M.; Donelson,John E.; Teixeira,Santuza M.R. (Experimental Parasitology, 2002)
Changes in tubulin expression are among the biochemical and morphological adaptations that occur during the life cycle of Trypanosomatids. To investigate the mechanism responsible for the differential accumulation of tubulin mRNAs in Trypanosoma cruzi, we determine the sequences of [alpha]- and [beta]-tubulin transcripts and analyzed their expression during the life cycle of the parasite. Two [beta]-tubulin mRNAs of 1.9 and 2.3 kb were found to differ mainly by an additional 369 nucleotides at the end of the 3' untranslated region (UTR). Although their transcription rates are similar in epimastigotes and amastigotes, [alpha]- and [beta]-tubulin transcripts are 3- to 6-fold more abundant in epimastigotes than in trypomastigotes and amastigotes. Accordingly, the half-lives of [alpha]- and [beta]-tubulin mRNAs are significantly higher in epimastigotes than in amastigotes. Transient transfection experiments indicated that positive regulatory elements occur in the 3' UTR plus downstream intergenic region of the [alpha]-tubulin gene and that both positive and negative elements occur in the equivalent regions of the [beta]-tubulin gene.Index Descriptions and Abbreviations: Kinetoplastida; Trypanosoma cruzi; tubulin; gene regulation; PCR, polymerase chain reaction; UTR, untranslated region; IR, intergenic region; SL, spliced leader; BAC, bacterial artificial chromosome.

An unsupervised method for word sense tagging using parallel corpora - Diab,M.; Resnik, Philip (Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, 2002)

On using correlation-based synopses during query optimization - Deshpande, Amol; Hellerstein,J. (Computer Science Division (EECS), University of California Berkeley, 2002)
In recent years, a variety of complex synopsis structures have been proposed to capturestatistical correlations present in database relations. The goal of that work has been to improve cardinality estimation during query optimization by improving statistics on base tables. In order to use the correlation information for multi-table estimations as well, synopses must also be constructed on intermediate result tables during query optimization. We address that problem here, and show how to efficiently integrate multi-dimensional histograms and other complex synopsis structures into the search algorithm of a traditional query optimizer such as that of System R. A main challenge in this work is minimizing the computational expense of dynamically computing synopses on intermediate tables during query optimization. We show that one only needs to construct a very small subset of all possible synopses to get the full estimation bene- fits of multi-dimensional modeling. We also show that choosing this subset unwisely can have unacceptable performance overheads. This leads to an “estimation planning” problem that has been ignored to date in literature: how to choose the most efficiently-computable collection of intermediate synopses to construct, so that all the required cardinality estimates can be com- puted as accurately as possible from the base-table synopses? In this paper, we identify and formalize the estimation planning problem in the context of a System R-style optimizer extended with complex synopsis techniques such as multi-dimensional histograms. We propose algorithms that find very good estimation plans efficiently, and discuss properties of synopsis structures that make them amenable to efficient use in an optimizer.

Video analysis applications for pervasive environments - Karunanidhi,A.; David Doermann; Parekh,N.; Rautio,V. (1st International Conference on Mobile and Ubiquitous Multimedia, 2002)
Network capabilities are expanding at arate that will soon allow a much wider range of image and video content to be delivered to and transmitted from mobile wireless devices. Current pervasive applications provide image and video content primarily in high performance networks or by streaming video over low-bandwidth networks. For video to be truly integrated into ubiquitous applications, we must carefully consider the role of automated video analysis to move beyond simple content delivery. Compression and content adaptation have been significant areas of research for some time and deal with the problem of moving media to devices with limited network, software and hardware capabilities. In the near future, mobile wireless devices that have been primarily consumers of image and video will be able to produce such content as well. In this paper, we will review some of the significant issues associated with providing video capabilities in pervasive environments. We consider not only streaming video applications, but point-to- point video and video messaging capabilities as well. We will show how our previous work on content adaptation is being applied to these types of environments, show what role more general video analysis can play and describe a general architecture for video capture, storage, analysis and transmission.

View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching - Der, S.Z.; Zheng,Q.; Redman, B.; Chellapa, Rama; Mahmoud, H. (OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-, 2002)

Virtual audio system customization using visual matching of ear parameters - Zotkin,Dmitry N; Duraiswami, Ramani; Davis, Larry S.; Mohan,A.; Raykar,V. (16th International Conference on Pattern Recognition, 2002. Proceedings, 2002)
Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhibit significant variation from person to person due to differences between their pinnae, and their body sizes. We propose and preliminarily implement a simple HRTF customization based on the use of a published database of HRTFs (Algazi et al., 2001) that also contains geometrical measurements of subject pinnae. We measure some of these features via simple image processing, and select the HRTF that has features most closely corresponding to the individual's features. This selection procedure is implemented along with the virtual auditory system described in (Zotkin et al., 2002), and listener tests conducted comparing the customized HRTF and a fixed HRTF. Despite the simplicity of the method, tests reveal average improvement in localization accuracy of about 25 percent, though performance improvement varies with source location and individuals.
Keywords: acoustic signal processing; Audio systems; Auditory system; Computer vision; database; Ear; ear parameter matching; geometrical measurements; Head; head related transfer functions; HRTF customization; Image databases; IMAGE PROCESSING; medical image processing; performance improvement; Position measurement; sonification; Spatial databases; System testing; Transfer functions; virtual audio system customization; virtual auditory spaces; virtual auditory system; visual matching

Virtual Telescopes in Education - Hoban,S.; desJardins, Marie; Farrell,N.; Rathod,P.; Sachs,J.; Sansare,S.; Yesha,Y.; Keating,J.; Busschots,B.; Means,J.; others (Journal of Digital Information, 2002)
Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.

A visual search tool for early elementary science students - Revelle,G.; Druin, Allison; Platner,M.; Bederson, Benjamin B.; Hourcade,J. P; Sherman,L. (Journal of Science Education and Technology, 2002)

Web question answering: is more always better? - Dumais,Susan; Banko,Michele; Brill,Eric; Jimmy Lin; Ng,Andrew (Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002)
This paper describes a question answering system that is designed to capitalize on the tremendous amount of data that is now available online. Most question answering systems use a wide variety of linguistic resources. We focus instead on the redundancy available in large corpora as an important resource. We use this redundancy to simplify the query rewrites that we need to use, and to support answer mining from returned snippets. Our system performs quite well given the simplicity of the techniques being utilized. Experimental results show that question answering accuracy can be greatly improved by analyzing more and more matching passages. Simple passage ranking and n-gram extraction techniques work well in our system making it efficient to use with many backend retrieval engines.

Active speech source localization by a dual coarse-to-fine search - Duraiswami, Ramani; Zotkin,Dmitry N; Davis, Larry S. (2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01), 2001)
Accurate and fast localization of multiple speech sound sources is a significant problem in videoconferencing systems. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched, and that the source is broadband, we develop an efficient search strategy that finds the source(s) in a given space. The search is made efficient by using coarse-to-fine strategies in both space and frequency. The algorithm is shown to be robust compared to typical delay-based estimators and fast enough for real-time implementation. Its performance can be further improved by using constraints from computer vision
Keywords: active speech source localization; array signal processing; Computer interfaces; Delay effects; delay estimation; delay-based estimators; dual coarse-to-fine search; Frequency; Inverse problems; Laboratories; multiple speech sound sources; Position measurement; real-time implementation; Sensor arrays; Signal processing algorithms; space; speech; Speech processing; Teleconferencing; videoconferencing systems

Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes - LaCount,D. J; El‐Sayed, Najib M.; Kaul,S.; Wanless,D.; Turner,C. M.R; Donelson,J. E (Nucleic acids research, 2001)

Becoming a Scholar in the Digital Age - Duderstadt,James; Arms,William; Messina,Paul; Ellisman,Mark; Atkins,Daniel; Fox,Edward; Shneiderman, Ben; Nissenbaum,Helen; Lederberg,Joshua (National Research Council, 2001)
Keywords: bibtex-import; digital-library; dlbook

A Call for Knowledge-Based Planning - Wilkins,David E; desJardins, Marie (AI Magazine, 2001)

A day in the life of … Marie DesJardins - desJardins, Marie (Crossroads, 2001)

Designing an Interactive Message Board as a Technology Probe for Family Communication - Browne,Hilary; Bederson, Benjamin B.; Plaisant, Catherine; Druin, Allison (Technical Reports of the Computer Science Department, 2001)
In this paper, we describe the design issues and technical implementation of aninteractive Family Message Board. The Family Message Board enables members of a distributed family to communicate with one another both synchronously and asynchronously via simple, pen-based, digital notes. Each household running thi$ Java-based software can view, create, and manipulate notes in a zoomable space. The Family Message Board will be used as a technology probe to help us unders$ the communication needs of distributed families, and to help us design new devi$ to meet those needs.
Keywords: Technical Report

Dynamic queries and brushing on choropleth maps - Dang,G.; North,C.; Shneiderman, Ben (Fifth International Conference on Information Visualisation, 2001. Proceedings, 2001)
Users who must combine demographic, economic or other data in a geographic context are often hampered by the integration of tabular and map representations. Static, paper-based solutions limit the amount of data that can be placed on a single map or table. By providing an effective user interface, we believe that researchers, journalists, teachers, and students can explore complex data sets more rapidly and effectively. This paper presents Dynamaps, a generalized map-based information visualization tool for dynamic queries and brushing on choropleth maps. Users can use color coding to show a variable on each geographic region, and then filter out areas that do not meet the desired criteria. In addition, a scatterplot view and a details-on-demand window support overviews and specific fact-finding
Keywords: brushing; business; cartography; choropleth maps; color coding; colour graphics; complex data sets; Computational Intelligence Society; Computer science; data visualisation; Data visualization; demographic data; Demography; Dynamaps; dynamic queries; economic data; Educational institutions; geographic information system; geographic information systems; Joining processes; map representations; map-based information visualization; Query processing; Scattering; scatterplot view; tabular representations; user interface; User interfaces; World Wide Web

Efficient and Non-interactive Non-malleable Commitment - Di Crescenzo,Giovanni; Katz, Jonathan; Ostrovsky,Rafail; Smith,Adam (Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001, 2001)
We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive . Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.
Keywords: Computer science

Efficient evaluation of reverberant sound fields - Duraiswami, Ramani; Gumerov, Nail A.; Zotkin,Dmitry N; Davis, Larry S. (Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the, 2001)
An image method due to Allen and Berkley (1979) is often used to simulate the effect of reverberation in rooms. This method is relatively expensive computationally. We present a fast method for conducting such simulations using multipole expansions. For M real and image sources and N evaluation points, while the image method requires O(MN) operations, our method achieves the calculations in O(M + N) operations, resulting in a substantial speedup. Applications of our technique are also expected in simulation of virtual audio
Keywords: AB algorithm; acoustic signal processing; architectural acoustics; audio signal processing; Computational modeling; Computer interfaces; Computer simulation; Educational institutions; image method; image sources; Impedance; Laboratories; microphone arrays; multipole expansions; Nails; performance evaluation; reverberant sound fields; reverberation; room reverberation; simulation; Simulations; speedup; virtual audio

Efficient Language Independent Generation from Lexical Conceptual Structure - Habash,Nizar; Dorr, Bonnie J; Traum,David (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2001)
This paper describes a system for generating natural-language sentences from an interlingual representation, Lexical Conceptual Structure (LCS). The system has been developed as part of a Chinese-English Machine Translation system; however, it is designed to be used for many other MT language pairs and Natural Language applications. The contributions of this work include: (1) Development of a language-independent generation system that maximizes efficiency through the use of a hybrid rule-based/statistical module; (2) Enhancements to an interlingual representation and associated algorithms for interpretation of multiply ambiguous input sentences; (3) Development of an efficient reusable language-independent linearization module with a grammar description language that can be used with other systems; (4) Improvements to an earlier algorithm for hierarchically mapping thematic roles to surface positions; (5) Development of a diagnostic tool for lexicon coverage and correctness and use of the tool for verification of English, Spanish, and Chinese lexicons. An evaluation of translation quality shows comparable performance with commercial translation system. The generation system can also be straightforwardly extended to their languages and this is demonstrated and evaluated for Spanish.
Keywords: *LEXICAL CONCEPTUAL STRUCTURE; *LEXICOGRAPHY; *MACHINE TRANSLATION; *VOCABULARY; *WORDS(LANGUAGE); algorithms; CHINA; COMMERCE; DIAGNOSTIC EQUIPMENT; efficiency; English language; grammars; INPUT; INTERLINGUAL; LANGUAGE; LANGUAGE-INDEPENDENT NLP.; linguistics; MAPPING; natural language; QUALITY; SPANISH LANGUAGE; verification

Efficient perspective-accurate silhouette computation and applications - Pop, Mihai; Duncan,Christian; Barequet,Gill; Goodrich,Michael; Huang,Wenjing; Kumar,Subodh (Proceedings of the seventeenth annual symposium on Computational geometry, 2001)
Silhouettes are perceptually and geometrically salient features of geo metric models. Hence a number of graphics and visualization applications need to find them to aid further processing. The efficient computation of silhouettes, especially in the context of perspective projection, is known to be difficult. This paper presents a novel efficient and practical algorithm to compute silhouettes from a sequence of viewpoints under perspective projection. Parallel projection is a special case of this algorithm. Our approach is based on a point-plane duality in three dimensions, which allows an efficient computation of the changes in the silhouette of a polygonal model between consecutive frames. In addition, we present several applications of our technique to problems from computer graphics and medical visualization. We also provide experimental data that show the efficiency of our approach. million vertices on an SGI Onyx workstation.
Keywords: rendering; silhouette; simplification

Efficient stepwise selection in decomposable models - Deshpande, Amol; Garofalakis,M. N; Jordan,M. I (Proc. UAI, 2001)

An efficient system for multi-perspective imaging and volumetric shape analysis - Borovikov,E.; Sussman, Alan; Davis, Larry S. (Proceedings of the 2001 Workshop on Parallel and Distributed Computing in Imaging Processing, Video Processing, and Multimedia, 2001)

Facilitating semantic web search with embedded grammar tags - Dorai,G. K; Yacoob,Yaser (IJCAI Workshop on E-Business and Intelligent Web, 2001)

A feature-based approach to automated design of multi-piece sacrificial molds - Dhaliwal,S.; Gupta,S.K.; Huang,J.; Kumar,M. (Journal of Computing and Information Science in Engineering, 2001)

Gesture-Driven Control of Spaces and Objects in Collaborative Augmented Reality - Yacoob,Yaser; Davis, Larry S. (GMD–Forschungszentrum Informationstechnik GmbH, 2001)

Independence is good: dependency-based histogram synopses for high-dimensional data - Deshpande, Amol; Garofalakis,Minos; Rastogi,Rajeev (SIGMOD Rec., 2001)
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical scenarios, including query optimization and approximate query answering. Existing solutions either rely on simplistic independence assumptions or try to directly approximate the full joint data distribution over the complete set of attributes. Unfortunately, both approaches are doomed to fail for high-dimensional data sets with complex correlation patterns between attributes. In this paper, we propose a novel approach to histogram-based synopses that employs the solid foundation of statistical interaction models to explicitly identify and exploit the statistical characteristics of the data. Abstractly, our key idea is to break the synopsis into (1) a statistical interaction model that accurately captures significant correlation and independence patterns in data, and (2) a collection of histograms on low-dimensional marginals that, based on the model, can provide accurate approximations of the overall joint data distribution. Extensive experimental results with several real-life data sets verify the effectiveness of our approach. An important aspect of our general, model-based methodology is that it can be used to enhance the performance of other synopsis techniques that are based on data-space partitioning (e.g., wavelets) by providing an effective tool to deal with the “dimensionality curse”.

Integrated information management: an interactive, extensible architecture for information retrieval - Nyberg,Eric; Daumé, Hal (Proceedings of the first international conference on Human language technology research, 2001)
Most current IR research is focused on specific technologies, such as filtering, classification, entity extraction, question answering, etc. There is relatively little research on merging multiple technologies into sophisticated applications, due in part to the high cost of integrating independently-developed text processing modules.

Interpretation of Compound Nominals Using WordNet - Barrett,Leslie; Davis,Anthony; Dorr, Bonnie J (Computational Linguistics and Intelligent Text ProcessingComputational Linguistics and Intelligent Text Processing, 2001)
We describe an approach to interpreting noun-noun compounds within a question answering system. The system’s lexicon, based on WordNet, provides the basis for heuristics that group noun-noun compounds with seman- tically similar words. The semantic relationship between the nouns in a com- pound is determined by the choice of heuristic for the compound. We discuss procedures for selecting one heuristic in cases where several can apply to a compound, the effects of lexical ambiguity, and some initial results of our methods.

KidStory: A technology design partnership with children - Taxén,G.; Druin, Allison; Fast,C.; Kjellin,M. (Behaviour & Information Technology, 2001)

Mapping lexical entries in a verbs database to WordNet senses - Green,Rebecca; Pearl,Lisa; Dorr, Bonnie J; Resnik, Philip (Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, 2001)
This paper describes automatic techniques for mapping 9611 entries in a database of English verbs to WordNet senses. The verbs were initially grouped into 491 classes based on syntactic features. Mapping these verbs into WordNet senses provides a resource that supports disambiguation in multilingual applications such as machine translation and cross-language information retrieval. Our techniques make use of (1) a training set of 1791 disambiguated entries, representing 1442 verb entries from 167 classes; (2) word sense probabilities, from frequency counts in a tagged corpus; (3) semantic similarity of WordNet senses for verbs within the same class; (4) probabilistic correlations between WordNet data and attributes of the verb classes. The best results achieved 72% precision and 58% recall, versus a lower bound of 62% precision and 38% recall for assigning the most frequently occurring WordNet sense, and an upper bound of 87% precision and 75% recall for human judgment.

Mapping WorldNet Senses to a Lexical Database of Verbs - Green,Rebecca; Pearl,Lisa; Dorr, Bonnie J (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2001)
This paper describes automatic techniques for mapping 9611 semantically classified English verbs to WordNet senses. The verbs were initially grouped into 491 semantic classes based on syntactic categories; they were then mapped into WordNet senses according to three pieces of information: (1) prior probability of WordNet senses; (2) semantic similarity of WordNet senses for verbs within the same category; and (3) probabilistic correlations between WordNet relationship and verb frame data. Our techniques make use of a training set of 1791 disambiguated entries representing 1442 verbs occurring in 167 of the categories. The best results achieved .58 recall and .72 precision, versus a lower bound of .38 recall and .62 precision for assigning the most frequently occurring WordNet sense, and an upper bound of .75 recall and .87 precision for human judgment.
Keywords: *DATA BASES; *ENGLISH LANGUAGE; *LEXICAL DATABASES; *LEXICOGRAPHY; *MAPPING; *VERBS; *WORD MAPPING; *WORDNET; AMBIGUITY; correlation; FRAMES; Frequency; INFORMATION SCIENCE; JUDGEMENT(PSYCHOLOGY); linguistics; PRECISION; probability; RECALL; semantics; syntax; WORDS(LANGUAGE); WSD(WORD SENSE DISAMBIGUATION)

Modeling the effect of a nearby boundary on the HRTF - Gumerov, Nail A.; Duraiswami, Ramani (2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01), 2001)
Understanding and simplified modeling of the head related transfer function (HRTF) holds the key to many applications in spatial audio. We develop an analytical solution to the problem of scattering of sound from a sphere in the vicinity of an infinite plane. Using this solution we study the influence of a nearby scattering rigid surface, on a spherical model for the HRTF
Keywords: Acoustic scattering; acoustic signal processing; acoustic wave reflection; acoustic wave scattering; architectural acoustics; audio signal processing; Biological system modeling; boundary effect modeling; Computer interfaces; Ear; Educational institutions; Frequency; Head related transfer function; HRTF; HUMANS; infinite plane; Laboratories; Nails; Raman scattering; rigid surface; room environment; sound pressure level; sound scattering; spatial audio; sphere; spherical model; Transfer functions; wall influence

Multimodal 3-D tracking and event detection via the particle filter - Zotkin,Dmitry N; Duraiswami, Ramani; Davis, Larry S. (IEEE Workshop on Detection and Recognition of Events in Video, 2001. Proceedings, 2001)
Determining the occurrence of an event is fundamental to developing systems that can observe and react to them. Often, this determination is based on collecting video and/or audio data and determining the state or location of a tracked object. We use Bayesian inference and the particle filter for tracking moving objects, using both video data obtained from multiple cameras and audio data obtained using arrays of microphones. The algorithms developed are applied to determining events arising in two fields of application. In the first, the behavior of a flying echo locating bat as it approaches a moving prey is studied, and the events of search, approach and capture are detected. In a second application we describe detection of turn-taking in a conversation between possibly moving participants recorded using a smart video conferencing setup
Keywords: algorithms; APPROACH; audio data collection; audio signal processing; Bayesian inference; Bayesian methods; belief networks; CAMERAS; capture; conversation; echo; Educational institutions; Event detection; event occurrence; filtering theory; flying echo locating bat behaviour; Image motion analysis; inference mechanisms; Laboratories; microphone arrays; moving object tracking; moving participants; moving prey; multimodal 3D tracking; multiple cameras; Object detection; particle filter; Particle filters; Particle tracking; Robustness; search; smart video conferencing setup; target tracking; Teleconferencing; tracking filters; turn-taking detection; video data collection; video signal processing

Multimodal localization of a flying bat - Ghose,K.; Zotkin,Dmitry N; Duraiswami, Ramani; Moss,C.F. (Acoustics, Speech, and Signal Processing, IEEE International Conference on, 2001)
We present a new multimodal system that combines stereoscopic and audio-based source localization to track the position of a flying bat. Also presented are novel algorithms for audio source localization. The bat was allowed to fly in an anechoic room and monitored by two high-speed video cameras. The vocalizations of the bat were simultaneously recorded from six microphones. The data was then processed offline to localize the source and reconstruct the trajectory of the bat. We compare the performance of the localization algorithm with the position data obtained from stereoscopic pictures of the bat. The results confirm that the stereoscopic analysis and the audio localization are in good agreement. This system opens up new possibilities for performing multimodal research, and developing more tightly integrated algorithms.

Multimodal tracking for smart videoconferencing - Zotkin,Dmitry N; Duraiswami, Ramani; Nanda,H.; Davis, Larry S. (Second International Conference on Multimedia and Expo, Tokyo, Japan, 2001)

Probabilistic temporal databases, I: algebra - Dekhtyar,Alex; Ross,Robert; V.S. Subrahmanian (ACM Trans. Database Syst., 2001)
Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database applications, there is often uncertainty about the start time of events, the end time of events, and the duration of events. When the granularity of time is small (e.g., milliseconds), a statement such as “Packet p was shipped sometime during the first 5 days of January, 1998” leads to a massive amount of uncertainty (5×24×60×60×1000) possibilities. As noted in Zaniolo et al. [1997], past attempts to deal with uncertainty in databases have been restricted to relatively small amounts of uncertainty in attributes. Dyreson and Snodgrass have taken an important first step towards solving this problem.In this article, we first introduce the syntax of Temporal-Probabilistic (TP) relations and then show how they can be converted to an explicit, significantly more space-consuming form, called Annotated Relations. We then present a theoretical annotated temporal algebra (TATA). Being explicit, TATA is convenient for specifying how the algebraic operations should behave, but is impractical to use because annotated relations are overwhelmingly large. Next, we present a temporal probabilistic algebra (TPA). We show that our definition of the TP-algebra provides a correct implementation of TATA despite the fact that it operates on implicit, succinct TP-relations instead of overwhemingly large annotated relations. Finally, we report on timings for an implementation of the TP-Algebra built on top of ODBC.

Probabilistic Temporal Databases, II: Calculus and Query Processing - Dekhtyar,A.; Ozcan,F.; Ross,R.; V.S. Subrahmanian (Technical Reports from UMIACS, UMIACS-TR-2001-79, 2001)
There is a vast class of applications in which we know that a certain event occurred, but do not know exactly when it occurred. However, as studied by Dyreson and Snodgrass \cite{ds98}, there are many natural scenarios where probability distributions exist and quantify this uncertainty. Dekhtyar et. al. extended Dyreson and Snodgrass's work and defined an extension of the relational algebra to handle such data. The first contribution of this paper is a declarative temporal probabilistic (TP for short) calculus which we show is equivalent in expressive power to the temporal probabilistic algebra of Dekhtyar et. al. Our second major contribution is a set of equivalence and containment results for the TP-algebra. Our third contribution is the development of cost models that may be used to estimate the cost of TP-algebra operations. Our fourth contribution is an experimental evaluation of the accuracy of our cost models and the use of the equivalence results as rewrite rules for optimizing queries by using an implementation of TP-databases on top of ODBC.

Reading between the lines: Lessons from the SDMI challenge - Craver,S.A.; Wu,M.; Liu,B.; Stubblefield,A.; Swartzlander,B.; Wallach,D.S.; Dean,D.; Felten,E.W. (Proceedings of the 10th USENIX Security Symposium, 2001)
The Secure Digital Music Initiative is a consortium ofparties interested in preventing piracy of digital music, and to this end they are developing architectures for con- tent protection on untrusted platforms. SDMI recently held a challenge to test the strength of four watermark- ing technologies, and two other security technologies. No documentation explained the implementations of the technologies, and neither watermark embedding nor de- tecting software was directly accessible to challenge par- ticipants. We nevertheless accepted the challenge, and explored the inner workings of the technologies. We re- port on our results here.

Review of Natural Language Processing in R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences - Dorr, Bonnie J (Artificial Intelligence, 2001)
The MIT Encyclopedia of the Cognitive Sciences (MITECS) is the first encyclopediain cognitive sciences—a web-navigable resource with invaluable information and several hundred links to related resources. The material provided therein is thorough and very clearly presented by the leading scientists in each area. This is one of the most comprehensive resources in cognitive science to date. It will serve as a teaching and research guide that users may frequently refer to for important definitions, background information, and citations to relevant literature. This review covers areas relevant to Natural Language Processing (NLP), in particular, the entries entitled “Natural Language Processing” (James Allen), “Computational Linguistics” (Aravind Joshi), “Generation” and “Machine Translation” (both by Eduard Hovy), “Computational Lexicons” (James Pustejovsky), and “Statistical Techniques” (Eugene Charniak). I will also address issues concerning the use of MITECS as an online, web-navigable document.

Spanish Language Processing at University of Maryland: Building Infrastructure for Multilingual Applications - Cabezas,C.; Dorr, Bonnie J; Resnik, Philip (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2001)
We describe here our construction of lexical resources, tool creation, building of an alignedparallel corpus, and an approach to automatic treebank creation that we have been de- veloping using Spanish data, based on projection of English syntactic dependency infor- mation across a parallel corpus.

Statistics Explains Geometrical Optical Illusions - Fermüller, Cornelia; Aloimonos, J. (Foundations of Image UnderstandingFoundations of Image Understanding, 2001)
Azriel Rosenfeld has been our mentor for the last decade. In everyday conversation he stressed the importance of intuition, the unreasonable effectiveness of mathematics in understanding the world, and the power of simplicity inherent in deep ideas. Because we mostly worked on 3D vision, he often argued that 2D vision has been, is, and will continue to be a large source of problems. Strangely enough, we arrived at this study, which is our first on 2D vision, through problems we encountered in our work in 3D motion and shape. Azriel Rosenfeld was also one of the first to apply statistics [ 27 , 28 ] to image analysis and understanding, and he always reminded us of the uncertainties involved in visual computations. This paper shows that statistics cannot be ignored, not even in the interpretation of two simple straight intersecting lines. It demonstrates that uncertainty in the visual data causes problems for the early visual processes. Because of noise, the estimation of features, such as lines, intersections of lines, and local image motion, is biased. The inevitability of this bias provides an explanation for many well-known geometrical optical illusions.

Temporal agent programs - Dix,Jürgen; Kraus,Sarit; V.S. Subrahmanian (Artificial Intelligence, 2001)
The “agent program” framework introduced by Eiter, Subrahmanian and Pick [Artificial Intelligence 108 (1–2) (1999) 179], supports developing agents on top of arbitrary legacy code. Such agents are continuously engaged in an “event occurs→think→act→event occurs…” 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 “temporal agent program” (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

Therapeutic play with a storytelling robot - Lathan,Corinna; Vice,Jack Maxwell; Tracey,Michael; Plaisant, Catherine; Druin, Allison; Edward,Kris; Montemayor,Jaime (CHI '01 extended abstracts on Human factors in computing systems, 2001)
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

Translation lexicon acquisition from bilingual dictionaries - David Doermann; Ma,H.; Karagol-Ayan,B.; Oard, Douglas (Proceedings of SPIE, 2001)

Active source location and beamforming - Duraiswami, Ramani; Zotkin,Dmitry N; Borovikov,Eugene A.; Davis, Larry S. (The Journal of the Acoustical Society of America, 2000)

Adaptive query processing: Technology in evolution - Hellerstein,J. M; Franklin,M.J.; Chandrasekaran,S.; Deshpande, Amol; Hildrum,K.; Madden,S.; Raman,V.; Shah,M. A (IEEE Data Engineering Bulletin, 2000)
As query engines are scaled and federated, they must cope with highly unpredictable and changeableenvironments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for global-area systems, massive parallelism, and sensor networks. To set the stage for our research, we present a survey of prior work on adaptive query processing, focusing on three characterizations of adaptivity: the frequency of adaptivity, the effects of adaptivity, and the extent of adaptivity. Given this survey, we sketch directions for research in the Telegraph project.

The African trypanosome genome - El‐Sayed, Najib M.; Hegde,Priti; Quackenbush,John; Melville,Sara E.; Donelson,John E. (International Journal for Parasitology, 2000)
The haploid nuclear genome of the African trypanosome, Trypanosoma brucei, is about 35 Mb and varies in size among different trypanosome isolates by as much as 25%. The nuclear DNA of this diploid organism is distributed among three size classes of chromosomes: the megabase chromosomes of which there are at least 11 pairs ranging from 1 Mb to more than 6 Mb (numbered I-XI from smallest to largest); several intermediate chromosomes of 200-900 kb and uncertain ploidy; and about 100 linear minichromosomes of 50-150 kb. Size differences of as much as four-fold can occur, both between the two homologues of a megabase chromosome pair in a specific trypanosome isolate and among chromosome pairs in different isolates. The genomic DNA sequences determined to date indicated that about 50% of the genome is coding sequence. The chromosomal telomeres possess TTAGGG repeats and many, if not all, of the telomeres of the megabase and intermediate chromosomes are linked to expression sites for genes encoding variant surface glycoproteins (VSGs). The minichromosomes serve as repositories for VSG genes since some but not all of their telomeres are linked to unexpressed VSG genes. A gene discovery program, based on sequencing the ends of cloned genomic DNA fragments, has generated more than 20 Mb of discontinuous single-pass genomic sequence data during the past year, and the complete sequences of chromosomes I and II (about 1 Mb each) in T. brucei GUTat 10.1 are currently being determined. It is anticipated that the entire genomic sequence of this organism will be known in a few years. Analysis of a test microarray of 400 cDNAs and small random genomic DNA fragments probed with RNAs from two developmental stages of T. brucei demonstrates that the microarray technology can be used to identify batteries of genes differentially expressed during the various life cycle stages of this parasite.

An assumptive logic programming methodology for parsing - Voll,K.; Tom Yeh; Dahl,V. (Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on, 2000)
We show how several novel tools in logic programming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction

An audio-video front-end for multimedia applications - Zotkin,Dmitry N; Duraiswami, Ramani; Davis, Larry S.; Haritaoglu,I. (2000 IEEE International Conference on Systems, Man, and Cybernetics, 2000)
Applications such as video gaming, virtual reality, multimodal user interfaces and videoconferencing, require systems that can locate and track persons in a room through a combination of visual and audio cues, enhance the sound that they produce, and perform identification. We describe the development of a particular multimodal sensor fusion system that is portable, runs in real time and achieves these objectives. The system employs novel algorithms for acoustical source location, video-based person tracking and overall system control, which are also described
Keywords: Acoustic noise; acoustical source location; Application software; audio cues; audio-video front-end; CAMERAS; Computer vision; Microphones; multimedia applications; multimedia systems; multimodal sensor fusion system; multimodal user interfaces; Position measurement; REAL TIME; Real time systems; real-time systems; sensor fusion; sound; Speech recognition; User interfaces; video cameras; video gaming; video-based person tracking; Videoconference; videoconferencing; Virtual reality; visual cues; Working environment noise

Automatic Text Detection and Tracking in Digital Video - Li,H.; David Doermann; Kia,O. (IEEE Transactions on Image Processing - Special Issue on Image and Video Processing for Digital Libraries, 2000)
Text that appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video's structure and for classification. In this work, we present algorithms for detecting and tracking text in digital video. Our system implements a scale-space feature extractor that feeds an artificial neural processor to detect text blocks. Our text tracking scheme consists of two modules: a sum of squared difference (SSD) based module to find the initial position and a contour-based module to refine the position. Experiments conducted with a variety of video sources show that our scheme can detect and track text robustly.

AVideo Text Detection System Based on Automated Training - Li,H.; David Doermann (ICPR, 2000)

Building a Chinese-English Mapping Between Verb Concepts for Multilingual Applications - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang (Envisioning Machine Translation in the Information FutureEnvisioning Machine Translation in the Information Future, 2000)
This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a Chinese-English lexicon for verbs, using thematic-role information to create links between Chinese and English conceptual information. We then present an approach to compensating for gaps in the existing resources. The resulting lexicon is used for multilingual applications such as machine translation and cross-language information retrieval.

A Case for Evolutionary Genomics and the Comprehensive Examination of Sequence Biodiversity - Pollock,David D; Eisen,Jonathan A.; Doggett,Norman A; Cummings, Michael P. (Molecular Biology and EvolutionMol Biol Evol, 2000)
Comparative analysis is one of the most powerful methods available for understanding the diverse and complex systems found in biology, but it is often limited by a lack of comprehensive taxonomic sampling. Despite the recent development of powerful genome technologies capable of producing sequence data in large quantities (witness the recently completed first draft of the human genome), there has been relatively little change in how evolutionary studies are conducted. The application of genomic methods to evolutionary biology is a challenge, in part because gene segments from different organisms are manipulated separately, requiring individual purification, cloning, and sequencing. We suggest that a feasible approach to collecting genome-scale data sets for evolutionary biology (i.e., evolutionary genomics) may consist of combination of DNA samples prior to cloning and sequencing, followed by computational reconstruction of the original sequences. This approach will allow the full benefit of automated protocols developed by genome projects to be realized; taxon sampling levels can easily increase to thousands for targeted genomes and genomic regions. Sequence diversity at this level will dramatically improve the quality and accuracy of phylogenetic inference, as well as the accuracy and resolution of comparative evolutionary studies. In particular, it will be possible to make accurate estimates of normal evolution in the context of constant structural and functional constraints (i.e., site-specific substitution probabilities), along with accurate estimates of changes in evolutionary patterns, including pairwise coevolution between sites, adaptive bursts, and changes in selective constraints. These estimates can then be used to understand and predict the effects of protein structure and function on sequence evolution and to predict unknown details of protein structure, function, and functional divergence. In order to demonstrate the practicality of these ideas and the potential benefit for functional genomic analysis, we describe a pilot project we are conducting to simultaneously sequence large numbers of vertebrate mitochondrial genomes.

Chinese-English Semantic Resource Construction - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang; Thomas,Scott (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
We describe an approach to large-scale construction of a semantic lexicon for Chinese verbs. We leverage off of three existing resources-- a classification of English verbs called EVCA (English Verbs Classes and Alternations), a Chinese conceptual database called HowNet, and a large-machine readable dictionary called Optilex. The resulting lexicon is used for determining appropriate word senses in applications such as machine translation and cross-language information retrieval.
Keywords: *CHINESE LANGUAGE; *ENGLISH LANGUAGE; *LEXICONS; *SEMANTICS; *VERBS; *WORD SENSES; *WORDS(LANGUAGE); classification; CONCEPTS; CONSTRUCTION; Dictionaries; INFORMATION SCIENCE; linguistics; VERB CLASSES; Vocabulary

Construction of Chinese-English Semantic Hierarchy for Information Retrieval - Levow,G.A.; Dorr, Bonnie J; Lin,D. (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
This paper describes an approach to large-scale construction of a semantic hierarchyfor Chinese verbs. Leveraging off of an existing Chinese conceptual databased called HowNet and a Levin-based Egnlish verb classification, we use thematic-role information to create links between Chinese concepts and English classes. The resulting hierarchy is used for multilingual lexicons in an English-Chinese cross-language information retrieval application. We demonstrate a structured syntax interface that exploits this large-scale hierarchy and its linages to WordNet for English-Chinese cross-language information re- trieval.

Cortical inhibition as explained by the competitive distribution hypothesis - Reggia, James A.; Sutton III,G. G.; Lynne,C.; D'Autrechy,S. C; Armentrout,S. L (Network models for control and processing, 2000)

Data and Content Based Adaptation for Video Over Low Bandwidth Networks - David Doermann; DeMenthon,D. (SPIE- Multimedia and Systems Applicaitons III, 2000)

Designing StoryRooms: interactive storytelling spaces for children - Alborzi,H.; Druin, Allison; Montemayor,J.; Platner,M.; Porteous,J.; Sherman,L.; Boltman,A.; Taxén,G.; Best,J.; Hammer,J.; others (Proceedings of the 3rd conference on Designing interactive systems: processes, practices, methods, and techniques, 2000)

Designing storytelling technologies to encouraging collaboration between young children - Benford,S.; Bederson, Benjamin B.; \AAkesson,K. P; Bayon,V.; Druin, Allison; Hansson,P.; Hourcade,J. P; Ingram,R.; Neale,H.; O'Malley,C.; others (Proceedings of the SIGCHI conference on Human factors in computing systems, 2000)

Event Detection from MPEGVideo in the Compressed Domain - Yoon,K.; DeMenthon,D.; David Doermann (ICPR, 2000)
The use of information in the compressed domain allows for the rapid analysis of video content using standard hardware. This paper describes two techniques for detecting dynamic events using the motion vectors obtained from the MPEG video encoding. In the first technique, feature vectors from motion information form a high dimensional curve for a video clip and curve simplication allows us to browse the clip along portions where interesting events are likely to happen. In the second technique, the camera motion, pan, tilt, and zoom are computed from the motion vectors, and the residual vectors which are not explained by the camera motion are regarded as generated by moving blobs. Events are detected from these moving blobs.

GCCS: A graphical coordination language for system specification - Cleaveland, Rance; Du,X.; Smolka,S. (Coordination Languages and Models, 2000)

Hidden Markov Models for Images - DeMenthon,D.; Stuckelberg,M. Vuilleumier; David Doermann (ICPR, 2000)
In this paper we investigate how speech recognition techniques can be extended to image processing. We describe a method for learning statistical models of images using a second order hidden Markov mesh model. First, an image can be segmented in a way that best matches its statistical model by an approach related to the dynamic programming used for segmenting Markov chains. Second, given an image segmentation a statistical model (3D state transition matrix and observation distributions within states) can be estimated. These two steps are repeated until convergence to provide both a segmentation and a statistical model of the image. We also describe a semi-Markov modeling technique in which the distributions of widths and heights of segmented regions are modeled explicitly by gamma distributions in a way related to explicit duration modeling in HMMs. Finally, we propose a statistical distance measure between images based on the similarity of their statistical models for classication and retrieval tasks.

Identifying Sports Videos using Replay, Text and Camera Motion Features - Kobla,V.; DeMenthon,D.; David Doermann (SPIE Conference on Storage and Retrieval for Image and Video Databases, 2000)
Automated classification of digital video is emerging as an important piece of the puzzle in the design of contentmanagement systems for digital libraries. The ability to classify videos into various classes such as sports, news, movies, or documentaries, increases the efficiency of indexing, browsing, and retrieval of video in large databases. In this paper, we discuss the extraction of features that enable identification of sports videos directly from the compressed domain of MPEG video. These features include detecting the presence of action replays, determining the amount of scene text in video, and calculating various statistics on camera and/or object motion. The features are derived from the macroblock, motion, and bit-rate information that is readily accessible from MPEG video with very minimal decoding, leading to substantial gains in processing speeds. Full-decoding of selective frames is required only for text analysis. A decision tree classifier built using these features is able to identify sports clips with an accuracy of about 93%.

Large-Scale Construction of a Chinese-English Semantic Hierarchy - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a semantic hierarchy for Chinese verbs, using thematic-role information to create links between Chinese concepts and English classes. We then present an approach to compensating for gaps in the existing resources. The resulting hierarchy is used for a multilingual lexicon for Chinese-English machine translation and cross-language information retrieval applications.
Keywords: *CHINESE VERBS; *HIERARCHIES; *SEMANTICS; CHINA; CROSS CORRELATION; Information retrieval; INFORMATION SCIENCE; LANGUAGE; LEXICONS; linguistics; Machine translation; MULTILINGUAL; operations research; SYSTEMS APPROACH

Learned models for estimation of rigid and articulated human motion from stationary or moving camera - Yacoob,Yaser; Davis, Larry S. (International Journal of Computer Vision, 2000)

Live multimedia adaptation through wireless hybrid networks - Koivisto,A.; Pietkainen,P.; Sauvola,J.; David Doermann (Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on, 2000)
We present new techniques to intelligently adapt and combine multimedia presentations in real-time, mobile service environments. We present the techniques necessary to perform mobile multimedia processing for multiple video streams with ldquo;value-adding rdquo; information. The adaptation uses video analysis, content-recognition and automated annotation to provide scalable and interactive presentations over hybrid networks to mobile terminals. As a concrete case, we present a mobile surveillance service called Princess, which has several video sources and supports control information, terminal adaptation and end-to-end service
Keywords: adaptation; mobile; adaptation; value-adding; analysis; wireless; annotation; content-recognition; end-to-end; communication; multimedia; communication; real-time; hybrid; information; video; LAN; multimedia; networks; mobile; Princess; automated; processing; mobile; service; live; service; mobile; streams; real-time; Surveillance; system; terminal; systems; surveillance; wireless; terminals; multiple; video

Measuring verb similarity - Resnik, Philip; Diab,M. (Proceedings of the Twenty-second Annual Conference of the Cognitive Science Society: August 13-15, 2000, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA, 2000)

A multi-level approach to interlingual machine translation: defining the interface between representational languages - Dorr, Bonnie J; Voss,C.R. (Natural language processing and knowledge representation, 2000)

Off-line Skilled Forgery Detection using Stroke and Substroke Features - Guo,K.; David Doermann; Rosenfeld, A. (ICPR, 2000)

A probabilistic framework for rigid and non-rigid appearance based tracking and recognition - De la Torre,F.; Yacoob,Yaser; Davis, Larry S. (Automatic Face and Gesture Recognition, 2000. Proceedings. Fourth IEEE International Conference on, 2000)

Residual coding in document image compression - Kia,O. E; David Doermann (Image Processing, IEEE Transactions on, 2000)
Symbolic document image compression relies on the detection of similar patterns in a document image and construction of a prototype library. Compression is achieved by referencing multiple pattern instances ( ldquo;components rdquo;) through a single representative prototype. To provide a lossless compression, however, the residual difference between each component and its assigned prototype must be coded. Since the size of the residual can significantly affect the compression ratio, efficient coding is essential. We describe a set of residual coding models for use with symbolic document image compression that exhibit desirable characteristics for compression and rate-distortion and facilitate compressed-domain processing. The first model orders the residual pixels by their distance to the prototype edge. Grouping pixels based on this distance value allows for a more compact coding and lower entropy. This distance model is then extended to a model that defines the structure of the residue and uses it as a basis for continuous and packet reconstruction which provides desired functionality for use in lossy compression and progressive transmission
Keywords: coding; coding; compressed-domain; coding; entropy; lossless; coding; image; communication; compact; compression; data; compression; document; compression; multiple; construction; rate-distortion; representative; detection; symbolic; difference; residual; distortion; document; edge; prototype; image; library; model; efficient; models; residual; pattern; patterns; pixels; similar; processing; compression; processing; entropy; image; prototype; residual; ratio; continuous; reconstruction; distance; reconstruction; progressive; reconstruction; rate; referencing; packet; theory; visual; transmission; prototype

Resolution enhancement by applying MFM under UHV conditions - Dreyer,M.; Gomez,R.D.; Mayergoyz, Issak D (Magnetics, IEEE Transactions on, 2000)
The enhancement in signal-to-noise ratio and lateral resolution in MFM in going from ambient pressure to UHV is demonstrated. The performance of several cantilevers is evaluated using a patterned 50 nm thick permalloy film, with cross-tie as well as 90 deg; domain walls, and a 200 nm thick permalloy film with perpendicular magnetization. The increase in the quality factor of the cantilever oscillation in UHV improves the sensitivity, consequently allowing less magnetic material on the tip to achieve the same signal-to-noise ratio. This reduction in magnetic volume sharpens the lateral resolution. We also demonstrate that the magnetic interaction can be so weak that a magnetic contrast is visible only under UHV conditions
Keywords: conditions; cantilevers; domain; contrast; magnetic; domain; enhancement; Permalloy; magnetic; enhancement; signal-to-noise; film; perpendicular; films; magnetisation; force; magnetization; resolution; MFM; NiFe; UHV; microscopy; magnetic; ratio; resolution; magnetic; thin; volume; permalloy; walls; lateral; walls; magnetic

Smart videoconferencing - Zotkin,Dmitry N; Duraiswami, Ramani; Philomin,V.; Davis, Larry S. (2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000, 2000)
The combination of acoustical and video processing to achieve a smart audio and video feed from a set of N microphones and M cameras is a task that might conventionally be accomplished by camera persons and control room staff. However, in the context of videoconferencing, this process needs to be performed by control software. We discuss the use of a multi-camera multi-microphone set-up for unattended videoconferencing, and present details of a prototype implementation being developed
Keywords: acoustical processing; Automatic control; CAMERAS; computerised control; control software; Control systems; Intelligent sensors; Layout; Microphones; multi-camera multi-microphone set-up; multimedia systems; Protocols; prototype implementation; Prototypes; sensor fusion; smart videoconferencing; Switches; Teleconferencing; unattended videoconferencing; video processing

A storytelling robot for pediatric rehabilitation - Plaisant, Catherine; Druin, Allison; Lathan,Corinna; Dakhane,Kapil; Edwards,Kris; Vice,Jack Maxwell; Montemayor,Jaime (Proceedings of the fourth international ACM conference on Assistive technologies, 2000)
Keywords: children; design process; rehabilitation; robot; therapeutic play; user interface

Superresolution-based enhancement of text in digital video - Huiping Li; David Doermann (Pattern Recognition, 2000. Proceedings. 15th International Conference on, 2000)
We present a superresolution-based text enhancement scheme to improve optical character recognition (OCR) and readability of text in digital video. The quality of video text is degraded by factors such as low resolution, antialiasing, clutter and blurring. We use the fact that the same text string often exists in consecutive frames to explore the temporal information and enhance the text image. For graphic text, we register text blocks to subpixel accuracy and fuse them to a new block with high resolution and a cleaner background. We use a projection onto convex sets based method to deblur scene text to improve readability. Experimental results show our scheme can improve OCR for graphic text and readability for scene text significantly
Keywords: accuracy; superresolution-based; antialiasing; blurring; clutter; digital; based; character; convex; Enhancement; enhancement; image; information; text; method; readability; subpixel; onto; recognition; resolution; image; resolution; projection; scheme; temporal; sequences; optical; sets; string; video; text; text; geometry; image; text; low; video; graphic

Telicity as a cue to temporal and discourse structure in Chinese-English machine translation - Olsen,Mari; Traum,David; Van Ess-Dykema,Carol; Weinberg, Amy; Dolan,Ron (Association for Computational Linguistics, 2000)
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.

Tools and Techniques for Video Performances Evaluation - David Doermann; Mihalcik,D. (ICPR, 2000)

Visualizing high-dimensional predictive model quality - Rheingans,P.; desJardins, Marie (Visualization 2000. Proceedings, 2000)
Using inductive learning techniques to construct classification models from large, high-dimensional data sets is a useful way to make predictions in complex domains. However, these models can be difficult for users to understand. We have developed a set of visualization methods that help users to understand and analyze the behavior of learned models, including techniques for high-dimensional data space projection, display of probabilistic predictions, variable/class correlation, and instance mapping. We show the results of applying these techniques to models constructed from a benchmark data set of census data, and draw conclusions about the utility of these methods for model understanding.

ACQUISITION OF SEMANTIC LEXICONS - Dorr, Bonnie J; Jones,D. (Breadth and depth of semantic lexicons, 1999)
This paper addresses the problem oflarge-scale acquisition of computational-semantic lexicons from machine-readable resources. We describe semantic filters designed to reduce the number ofincorrect assignments (i.e., improve precision) made by a purely syntactic technique. We demonstrate that it is possible to use these filters to build broad-coverage lexicons with minimal effort, at a depth of knowledge that lies at the syntax-semantics interface. We report on our results of disambiguating the verbs in the semantic filters by adding WordNet sense annotations. We then show the results of our classification on unknown words and we evaluate these results.

ARobust Method for Unknown Forms Analysis - Xingyuan,L.; David Doermann; Oh,W.; Gao,W. (ICDAR, 1999)

The Bible as a parallel corpus: Annotating the ‘Book of 2000 Tongues’ - Resnik, Philip; Olsen,M.B.; Diab,M. (Computers and the Humanities, 1999)

Building Mosaics from Video Using MPEG Motion Vectors - Jones,R.; DeMenthon,D.; Doermann, David (ACM Conference on Multimedia, 1999)
In this paper we present a novel way of creating mosaics from an MPEG video sequence. Two original aspects of our work are that (1) we explicitly compute camera motion between frames and (2) we deduce the camera motion directly from the motion vectors encoded in the MPEG video streamï¿½. This enables us to create mosaics more simply and quickly than with other methods.

Building mosaics from video using MPEG motion vectors - Jones,R.; DeMenthon,D.; David Doermann (University of Maryland, College Park, 1999)
In this paper we present a novel way of creating mosaics from an MPEG video sequence. Two original aspects of our work are that (1) we explicitly compute camera motion between frames and (2) we deduce the camera motion directly from the motion vectors encoded in the MPEG video stream. This enables us to create mosaics more simply and quickly than with other methods.

Classification of Document Page Images - Shin,C.; David Doermann (SDIUT99, 1999)

Content-Based Access to Multimedia Information: From Technology Trends to Sate of the Art - Perry,B.; Chang,S-K.; Dinsmore,J.; David Doermann; Rosenfeld, A.; Stevens,S. (Kluwer, 1999)

Cooperative inquiry: developing new technologies for children with children - Druin, Allison (Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit, 1999)

Coordinating a Distributed Planning System - desJardins, Marie; Wolverton,Michael (AI Magazine, 1999)
Distributed SIPE (DSIPE) is a distributed planning system that provides decision support to human planners in a collaborative planning environment. The key contributions of our research on DSIPE are (1) constraint-based, consistent local views of the global plan that give each planner a view of how other planners' subplans relate to their local planning decisions; (2) methods for automatically identifying and sharing potentially relevant information among distributed planning agents; and (3) techniques for merging subplans that leverage the shared subplan structure to generate a complete, final plan. DSIPE is a fully implemented system and has been demonstrated to end users in the maritime (United States Navy and United States Marine Corps) planning community.

Creating a parallel corpus from the book of 2000 tongues - Resnik, Philip; Olsen,M.B.; Diab,M. (Computers and the Humanities, 1999)

Designing PETS: a personal electronic teller of stories - Druin, Allison; Montemayor,Jamie; Hendler,Jim; McAlister,Britt; Boltman,Angela; Fiterman,Eric; Plaisant,Aurelie; Kruskal,Alex; Olsen,Hanne; Revett,Isabella; Schwenn,Thomas Plaisant; Sumida,Lauren; et al. (Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit, 1999)
We have begun the development of a new robotic pet that cansupport children in the storytelling process. Children can build their own pet by snapping together the modular animal parts of the PETS robot. After their pet is built, children can tell stories using the My Pets software. These stories can then be acted out by their robotic pet. This video paper describes the motivation for this research and the design process of our intergenerational design team in building the first PETS prototypes. We will discuss our progress to date and our focus for the future.
Keywords: children; cooperative inquiry; design techniques; educational applications; intergenerational design team; PETS; ROBOTICS

Detection of slow-motion replay sequences for identifying sports videos - Kobla,V.; DeMenthon,D.; David Doermann (Proceedings of IEEE 1999 Workshop on Multimedia Signal Processing, 1999)
Automated classication of digital video is emerging as an important piece of the puzzle in the design of content management systems for digital libraries. The ability to classify videos into various genres such as sports, news, movies, or documentaries increases the efficiency of indexing, browsing, and retrieval of video in large databases. In this paper we present an automated technique for identifying slow motion replays directly from the compressed domain of MPEG video, It uses the macroblock motion and bit-rate information that is readily accessible from MPEG video with very minimal decoding, leading to enormous gains in processing speeds.

Efficient perspective-accurate silhouette computation - Barequet,G.; Duncan,C. A; Goodrich,M. T; Kumar,S.; Pop, Mihai (Proceedings of the fifteenth annual symposium on Computational geometry, 1999)

Estimation of composite object and camera image motion - Yacoob,Yaser; Davis, Larry S. (The Proceedings of the Seventh IEEE International Conference on Computer Vision, 1999, 1999)
An approach for estimating composite independent object and camera image motions is proposed. The approach employs spatio-temporal flow models learned through observing typical movements of the object, to decompose image motion into independent object and camera motions. The spatio-temporal flow models of the object motion are represented as a set of orthogonal flow bases that are learned using principal component analysis of instantaneous flow measurements from a stationary camera. These models are then employed in scenes with a moving camera to extract motion trajectories relative to those learned. The performance of the algorithm is demonstrated on several image sequences of rigid and articulated bodies in motion
Keywords: articulated bodies; camera image motion; camera image motions; CAMERAS; composite independent object; composite object estimation; Computer vision; Educational institutions; Image sequences; instantaneous flow measurements; Laboratories; Layout; Motion analysis; Motion estimation; motion trajectories; orthogonal flow bases; Principal component analysis; spatio-temporal flow models; tracking; Vehicles

Exact solutions for the problem of source location from measured time differences of arrival - Duraiswami, Ramani; Zotkin,Dmitry N; Davis, Larry S. (The Journal of the Acoustical Society of America, 1999)

Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism - Dascal,S.; Vishkin, Uzi (Algorithm Engineering, 1999)

Human-centered computing, online communities, and virtual environments - Brown,J. R; van Dam,A.; Earnshaw,R.; Encarnacao,J.; Guedj,R.; Preece,J.; Shneiderman, Ben; Vince,J. (IEEE Computer Graphics and Applications, 1999)
This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications
Keywords: Books; Collaboration; Collaborative work; Conferences; EC/NSF joint Advanced Research Workshop; Feeds; Human computer interaction; human-centered computing; Internet; Joining materials; Laboratories; Online communities; Research initiatives; USA Councils; User interfaces; Virtual environment; virtual environments; Virtual reality

Interface and data architecture for query preview in networked information systems - Plaisant, Catherine; Shneiderman, Ben; Doan,Khoa; Bruns,Tom (ACM Trans. Inf. Syst., 1999)
There are numerous problems associated with formulating queries onnetworked information systems. These include increased data volume and complexity, accompanied by slow network access. This article proposes a new approach to a network query user interfaces that consists of two phases: query preview and query refinement. This new approach is based on the concepts of dynamic queries and query previews, which guides users in rapidly and dynamically eliminating undesired records, reducing the data volume to a manageable size, and refining queries locally before submission over a network. Examples of two applications are given: a Restaurant Finder and a prototype for NASA's Earth Observing Systems Data Information Systems (EOSDIS). Data architecture is discussed, and user feedback is presented.
Keywords: direct manipulation; dynamic query; EOSDIS; graphical user interface; query preview; query refinement; science data

Local model checking and protocol analysis - Du,X.; Smolka,S. A; Cleaveland, Rance (International Journal on Software Tools for Technology Transfer (STTT), 1999)

Machine Translation - Bel,N.; Dorr, Bonnie J; Hovy,E.; Knight,K.; Iida,H.; Boitet,C.; Maegaard,B.; Wilks,Y. (Multilingual Information Management: Current Levels and Future Abilities, 1999)

Model Based Graphics Recognition - Stuckelberg,M.V.; David Doermann (GREC, 1999)

More surprises from Kinetoplastida - Donelson,J. E; Gardner,M. J; El‐Sayed, Najib M. (Proceedings of the National Academy of Sciences of the United States of America, 1999)

On musical score recognition using probabilistic reasoning - Stuckelberg,M.V.; David Doermann (Document Analysis and Recognition, 1999. ICDAR '99. Proceedings of the Fifth International Conference on, 1999)
We present a probabilistic framework for document analysis and recognition and illustrate it on the problem of musical score recognition. Our system uses an explicit descriptive model of the document class to find the most likely interpretation of a scanned document image. In contrast to the traditional pipeline architecture, we carry out all stages of the analysis with a single inference engine, allowing for an end-to-end propagation of the uncertainty. The global modeling structure is similar to a stochastic attribute grammar, and local parameters are estimated using hidden Markov models
Keywords: analysis; document; attribute; class; document; descriptive; document; engine; local; estimation; musical; grammar; attribute; grammars; character; handling; image; interpretation; stochastic; Markov; mechanisms; music; uncertainty; model; global; modeling; models; inference; parameter; processing; image; propagation; explicit; reasoning; scanned; recognition; document; recognition; end-to-end; recognition; inference; recognition; probabilistic; score; structure; hidden; Uncertainty

Nano-to-millimeter scale integrated systems - Last,H.R.; Deeds,M.; Garvick,D.; Kavetsky,R.; Sandborn,P. A.; Magrab,E. B.; Gupta,S.K. (Components and Packaging Technologies, IEEE Transactions on, 1999)
Over the last several years various industries have been developing nano, micro, and millimeter scale technologies, which have resulted in components ranging from quantum transistors, to widely commercialized integrated circuits, to microelectromechanical sensors. A common emphasis of these fabrication industries has been on the integration of different functions in miniaturized systems; however, the technology currently used to realize these systems is monolithic. A unique class of hybrid technology systems is Integrated nano to millimeter (In2m) systems. An In2m system typically has components spanning multiple sizes, diverse technology domains, and mixtures of electrical, mechanical, thermal, chemical, fluidic, and biological functions
Keywords: fabrication technology; In2m; integrated nano to millimeter system; micromechanical devices; nanotechnology

Page Segmentation and Zone Classification: The State of the Art - Okun,O.; David Doermann; Pietikainen,M. (University of Maryland, College Park, 1999)
Page segmentation and zone classification are key areas of research in document image processing, because they occupy an intermediate position between document preprocessing and higher-level document understanding such as logical page analysis and OCR. Such analysis of the page relies heavily on an appropriate document model and results in a representation of the physical structure of the document. The purpose of this review is to analyze progress made in page segmentation and zone classification and suggest what needs to be done to advance the field.

A real-time audio–video front-end for multimedia applications - Zotkin,Dmitry N; Duraiswami, Ramani; Hariatoglu,I.; Davis, Larry S.; Otsuka,T. (The Journal of the Acoustical Society of America, 1999)

Reports on the AAAI Fall Symposia - De Giacomo,Giuseppe; desJardins, Marie; Canamero,Dolores; Wasson,Glenn; Littman,Michael; Allwein,Gerard; Marriott,Kim; Meyer,Bernd; Webb,Barbara; Consi,Tom (AI Magazine, 1999)
The Association for the Advancement of Artificial Intelligence (AAAI) held its 1998 Fall Symposium Series on 23 to 25 October at the Omni Rosen Hotel in Orlando, Florida. This article contains summaries of seven of the symposia that were conducted: (1) Cognitive Robotics; (2) Distributed, Continual Planning; (3) Emotional and Intelligent: The Tangled Knot of Cognition; (4) Integrated Planning for Autonomous Agent Architectures; (5) Planning with Partially Observable Markov Decision Processes; (6) Reasoning with Visual and Diagrammatic Representations; and (7) Robotics and Biology: Developing Connections.

Single display groupware: a model for co-present collaboration - Stewart,J.; Bederson, Benjamin B.; Druin, Allison (Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit, 1999)

Special effect edit detection using VideoTrails: a comparison with existing techniques - Kobla,V.; DeMenthon,D.; David Doermann (Proceedings of SPIE - Conference on Storage and Retrieval for Image and Video Databases VII, 1999)
Video Segmentation plays an integral role in many multimedia applications such as digital libraries, content management systems, and various other video browsing, indexing, and retrieval systems. Many algorithms for segmentation of video have appeared in the past few years, Most of these algorithms perform well on cuts, but yield poor performance on gradual transitions or special effect edits. A complete video segmentation system must achieve good performance on special effect edit detection also. In this paper, we discuss the performance of our VideoTrails based algorithms with other existing special effect edit detection algorithms in literature. Results from experiments testing for the ability to detect edits from TV programs ranging from commercials to news magazine programs, and also diverse special effect edits introduced by us have been shown.

A Study of the Structure of the Web - Deshpande, Amol; Huang,R.; Raman,V.; Riggs,T.; Song,D.; Subramanian,L. (University of California, Berkeley, 1999)
The World Wide Web is a huge, growing repository of information on a wide range of topics. It is alsobecoming important, commercially and sociologically, as a place of human interaction within different communities. In this paper we present an experimental study of the structure of the Web. We analyze link topologies of various communities, and patterns of mirroring of content, on 1997 and 1999 snapshots of the Web. Our results give insight into patterns of interaction within communities and how they evolve, as well as patterns of data replication. We also describe the techniques we have developed for performing complex processing on this large data set, and our experiences in doing so. We present new algorithms for finding partial and complete mirrors in URL hierarchies; these are also of independent interest for search and redirection. In order to study and visualize link topologies of different communities, we have developed techniques to compact these large link graphs without much information loss.

A Survey of Current Paradigms in Machine Translation - Dorr, Bonnie J; Jordan,Pamela W.; Benoit,John W. (Advances in Computers, 1999)
This paper is a survey of the current machine translation research in the US, Europe and Japan. A short history of machine translation is presented first, followed by an overview of the current research work. Representative examples of a wide range of different approaches adopted by machine translation researchers are presented. These are described in detail along with a discussion of the practicalities of scaling up these approaches for operational environments. In support of this discussion, issues in, and techniques for, evaluating machine translation systems are addressed.

A Survey of Research in Distributed, Continual Planning - desJardins, Marie; Durfee,Edmund H; Ortiz,Jr.; Wolverton,Michael J (AI Magazine, 1999)

Temporal multi-scale models for flow and acceleration - Yacoob,Yaser; Davis, Larry S. (International Journal of Computer Vision, 1999)

Text Enhancement in Digital Video - Li,H.; Kia,O.; David Doermann (Proceedings of SPIE - Conference on Document Recognition and Retrieval VI, 1999)

Text enhancement in digital video using multiple frame integration - Huiping Li; David Doermann (Proceedings of the seventh ACM international conference on Multimedia (Part 1), 1999)
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.

Tracking rigid motion using a compact-structure constraint - Yacoob,Yaser; Davis, Larry S. (Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on, 1999)
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

Visualization of high-dimensional model characteristics - desJardins, Marie; Rheingans,Penny (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, 1999)
Using inductive learning techniques to construct explanatory models for large, high-dimensional data sets is a useful way to discover useful information. However, these models can be difficult for users to understand. We have developed a set of visualization methods that enable a user to evaluate the quality of learned models, to compare alternative models, and identify ways in which a model might be improved We describe the visualization techniques we have explored, including methods for high-dimensional data space projection, variable/class correlation, instance mapping, and model sampling We show the results of applying these techniques to several models built from a benchmark data set of census data.
Keywords: data mining and knowledge discovery; multidimensional information spaces; Visualization

Automatic Identification of Text In Digital Video Key Frames - Li,H.; David Doermann (Proceedings of International Conference on Pattern Recognition, 1998)
Scene and graphic text can provide important supplemental index information in video sequences. In this paper we address the problem automatically identifying text regions in digital video key frames. The text contained in video frames is typically very noisy because it is aliased and/or digitized at a much lower resolution than typical document images, making identification, extraction and recognition difficult. The proposed method is based on the use of a hybrid wavelet/neural network segmenter on a series of overlapping small windows to classify regions which contain text. To detect text over a wide range of font sizes, the method is applied to a pyramid of images and the regions identified at each level are integrated.

Automatic Text Detection and Tracking in Digital Video - Li,H.; David Doermann; Kia,O. (University of Maryland, College Park, 1998)
Text which either appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video's structure and for classification. In this paper we present algorithms for detecting and tracking text components that appear within digital video frames. Our system implements a scale-space feature extractor that feeds an artificial neural processor to extract textual regions and track their movement over time. The extracted regions can then be used as input to an appropriate Optical Character Recognition system which produces indexible keywords.

Automatic Text Tracking In Digital Videos - Li,H.; David Doermann (Proceedings of IEEE 1998 Workshop on Multimedia Signal Processing, 1998)
We address the problem of automatically tracking moving text in digital videos. Our scheme consists of two separate processes: monitoring which detects the new text line entering a frame, and tracking which uses prediction techniques to reconcile the text from frame to frame. Temporal consistency allows one to monitor periodically and reduce the computation complexity. The tracking process uses a rapid prediction/search scheme to update the position of the text blocks between frames. We provide details of the implementation and results for text moving in the scene and text which moves as a result of camera motion.

Bilingual Lexicon Construction Using Large Corpora - Shen,Wade; Dorr, Bonnie J (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 1998)
This paper introduces a method for learning bilingual term and sentencelevel alignments for the purpose of building lexicons. Combining statistical techniques with linguistic knowledge, a general algorithm is developed for learning term and sentence alignments from large bilingual corpora with high accuracy. This is achieved through the use of filtered linguistic feedback between term and sentence alignment processes. An implementation of this algorithm, TAG-ALIGN, is evaluated against approaches similar to [Brown et al. 1993] that apply Bayesian techniques for term alignment, and [Gale and Church 1991] a dynamic programming method for aligning sentences. The ultimate goal is to produce large bilingual lexicons with a high degree of accuracy from potentially noisy corpora. (Also cross-referenced as UMIACS-TR-97-50)
Keywords: Technical Report

A Comparative Study of Knowledge-Based Approaches for Cross-Language - Oard, Douglas; Dorr, Bonnie J; Hackett,P.; Katsova,M. (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 1998)
Cross-language retrieval systems seek to use queries in one natural language to guide theretrieval of documents that might be written in another. Acquisition and representation of translation knowledge plays a central role in this process. This paper explores the util- ity of two sources of manually encoded translation knowledge, bilingual dictionaries and translation lexicons, for cross-language retrieval. We have implemented six query trans- lation techniques that use bilingual dictionaries, one based on lexical-semantic analysis, and one based on direct use of the translation output from an existing machine transla- tion system; these are compared with a document translation technique that uses output from the same existing translation system. Average precision measures on portions of the TREC collection suggest that arbitrarily selecting a single translation from a bilingual dictionary is typically no less effective than using every translation in the dictionary, that query translation using an existing machine translation system can achieve some- what better effectiveness than simple dictionary-based techniques, and that performing document translation rather than query translation may result in further improvements in retrieval effectiveness under some conditions.

Controlling communication in distributed planning using irrelevance reasoning - Wolverton,Michael; desJardins, Marie (Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, 1998)
Efficient and effective distributed planning requires careful control over how much information the planning agents broadcast to one another. Sending too little information could result in incorrect plans, while sending too much information could overtax the distributed planning system's resources (bandwidth and computational power). Ideally, distributed planning systems would have an efficient technique for filtering a large amount of irrelevant information from the message stream while retaining all the relevant messages. This paper describes an approach to controlling information distribution among planning agents using irrelevance reasoning (Levy & Sagiv 1993). In this approach, each planning agent maintains a data structure encoding the planning effects that could potentially be relevant to each of the other agents, and uses this structure to decide which of the planning effects that it generates will be sent to other agents. We describe an implementation of this approach within a distributed version of the SIPE-2 planner. Our experiments with this implementation show two important benefits of the approach: first, a noticeable speedup of the distributed planners; second--and, we argue, more importantly--a substantial reduction in message traffic.

The design and evaluation of a high-performance earth science database - Shock,Carter T.; Chang,Chialin; Moon,Bongki; Acharya,Anurag; Davis, Larry S.; Saltz,Joel; Sussman, Alan (Parallel Computing, 1998)
Earth scientists have encountered two major obstacles in their attempts to use remotely sensed imagery to analyze the earth's land cover dynamics. First, the volume of data involved is very large and second, significant preprocessing is needed before the data can be used. This is particularly so for studies that analyze global trends using data sets that cover multiple years. In this paper, we present the design of an earth science database as well as our early experiences with it. The primary design goal of this database is to facilitate efficient access to and preprocessing of large volumes of satellite data. Our initial design assumed that the main bottleneck in the system would be retrieving data from the disks. However, experimental results show that precise identification of all the data values corresponding to a query can take a significant amount of time. The problem is even more pronounced in designing the system to attempt to minimize time spent performing I/O. We therefore discuss a major redesign of the system that includes a reworking of the indexing scheme and a reorganization of the data on disks. Experimental results show that the redesigned system performs significantly better than the original system, providing interactive response times for local queries.
Keywords: Communication; High-performance I/O; load balancing; scalability; Scientific databases

The detection of duplicates in document image databases - David Doermann; Huiping Li; Kia,Omid (Image and Vision Computing, 1998)
Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival purposes with an index as simple as a case number, or with the ultimate goal of automatically extracting index information for content-based queries. Maintaining the integrity of such a database is difficult, however, especially in a distributed environment where copies of the same documents may be scanned at different times.In this paper we present a novel approach to detecting duplicate documents in very large databases using only features extracted from the image. The method is based on a robust `signature' extracted from each document image which is used to index into a table of previously processed documents. The system is able to deal with differences between scanned document instances such resolution, skew and image quality. The approach has a number of advantages over OCR or other recognition-based methods including speed and robustness to imaging distortions. To justify the approach and demonstrate its scalability, we have developed a simulator which allows us to change parameters of the system and examine performance while processing millions of document signatures. A complete system has been implemented and tested on a collection of technical articles and memos.
Keywords: Document image databases; Document indexing; Duplicate detection; Shape coding

Developing High-Level Representations of Video Clips using VideoTrails - Kobla,V.; David Doermann; Faloutsos,C. (Proceedings of the SPIEConference on Storage and Retrieval for Image and Video Databases VI, 1998)
A high-level representation of a video clip comprising information about its physical and semantic structure isnecessary for providing appropriate processing, indexing and retrieval capabilities for video databases. We describe a novel technique which reduces a sequence of MPEG encoded video frames to a trail of points in a low dimensional space. In our earlier work, we presented techniques applicable in 3-D, but in this paper, we describe techniques that can be extended to higher dimensions where improved performance is expected. In the low-dimensional space, we can cluster frames, analyze transitions between clusters and compute properties of the resulting trail. Portions of the trail can be classi ed as either stationary or transitional, leading to high-level descriptions of the video. Tracking the interaction of clusters over time, we lay the groundwork for the complete analysis and representation of the video's physical and semantic structure.

Digital dynamic telepathology–the Virtual Microscope. - Afework,A.; Beynon,M. D; Bustamante,F.; Cho,S.; Demarzo,A.; Ferreira,R.; Miller,R.; Silberman,M.; Saltz, J.; Sussman, Alan; others (Proceedings of the AMIA Symposium, 1998)

Document Image Coding for Processing and Retrieval - Kia,O.; David Doermann (Journal of VLSI Signal Processing, 1998)
Document images belong to a unique class of images where the information is embedded in the language represented by a series of symbols on the page rather than in the visual objects themselves. Since these symbols tend to appear repeatedly, a domain-specific image coding strategy can be designed to facilitate enhanced compression and retrieval. In this paper we describe a coding methodology that not only exploits component-level redundancy to reduce code length but also supports efficient data access. The approach identifies and organizes symbol patterns which appear repeatedly. Similar components are represented by a single prototype stored in a library and the location of each component instance is coded along with the residual between it and its prototype. A representation is built which provides a natural information index allowing access to individual components. Compression results are competitive and compressed-domain access is superior to competing methods. Applications to network-related problems have been considered, and show promising results.

Document Image Understanding - 1997 - David Doermann (University of Maryland, College Park, 1998)
This report contains nearly 500 references which are directly related to the field of document image understanding and appeared in major journals and conferences during 1997. Each reference is classified by major topic. Areas covered include, but are not limited to, preprocessing, models and representations, on-line recognition, off-line recognition, graphics recognition and interpretation, page processing, post-processing and special applications. ABibTeX version of the bibliography as well as search capabilities are available on-line at url http://documents.cfar.umd.edu/biblio/.

Enhancing Automatic Acquisition of Thematic Structure in a Large-Scale Lexicon for Mandarin Chinese - Olsen,Mari; Dorr, Bonnie J; Thomas,Scott (Machine Translation and the Information SoupMachine Translation and the Information Soup, 1998)
This paper describes a refinement to our procedure for porting lexical conceptual structure (LCS) into new languages. Specifically we describe a two-step process for creating candidate thematic grids for Mandarin Chinese verbs, using the English verb heading the VP in the subde_nitions to separate senses, and roughly parsing the verb complement structure to match thematic structure templates. We accomplished a substantial reduction in manual effort, without substantive loss. The procedure is part of a larger process of creating a usable lexicon for interlingual machine translation from a large on-line resource with both too much and too little information.

Evaluating Resources for Query Translation in Cross-Language Information Retrieval - Dorr, Bonnie J; Oard, Douglas (In Proceedings of the First International Conference on Language Resources and Evaluation, 1998)
Our goal is to evaluate the utility of a lexical resource containing Lexical Conceptual Structures (LCS) for use in cross-language information retrieval. Our evaluation makes use of a combination of techniques from interlingual machine translation with conventional information retrieval techniques. Given a query in one language, we transform the query into the corresponding terms in a second language. Our focus is on the construction of disambiguated targetlanguage queries by using verb-based entries in our lexicon to construct Lexical Conceptual Structures. The main innovation of LCS-based query translation is that it provides a principled framework for controlling translation ambiguity in cross-language information retrieval applications. We evaluate this approach by comparing the resulting retrieval effectiveness with alternative techniques based that use offthe -shelf machine translation or translation knowledge extracted from machine readable dictionaries. We view this work as an important demonstration of techniques for evaluating the utility of alternative structures for multilingual lexicons in cross-language IR applications. In addition, this work provides a basis for measuring the extent to which disambiguation can enhance cross-language information retrieval effectiveness.

Evaluation of EuroWordNet-and LCS-based lexical resources for machine translation - Dorr, Bonnie J; Marti,A.; Castellon,I. (Proceedings from First International Conference on Language Resources & Evaluation, 1998)
We evaluate two types of lexical resources with respect to their applicability to interlingual machine translation: (1) a EuroWordNet-based database of bilingual links between Spanish and English words; and (2) a repository of semantically classified verbs with their corresponding Lexical Conceptual Structure (LCS) representations. We examine the utility of these two resources for the task of lexical selection in machine translation. Our approach uses a coarse-grained graph-matching scheme that selects target-language words based on their LCS representation. The final selection of target-language terms is based on a finer-grained linking into the EuroWordNet-based repository.

Explicit Multi-Threading (XMT) bridging models for instruction parallelism (extended abstract) - Vishkin, Uzi; Dascal,S.; Berkovich,E.; Nuzman,J. (Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, 1998)

Extension of Spherical Harmonic Method to RF Transient Regime - Lin,C. K.; Goldsman,N.; Chang,C. H.; Mayergoyz, Issak D; Aronowitz,S.; Dong,J.; Belova,N. (Simulation of semiconductor processes and devices 1998: SISPAD 98, 1998)
The space and time dependent electron Boltzmann transport equation (BTE)is solved sclf-consistently with the Poisson and transient hole current-continuity equation. A transient Spherical Harmonic expansion method is used to solve the BTE. By this method we can efficiently solve the BTE in the RF regime to observe how the complete distribution function responds to a rapid transient. Calculations on a BJT, which give the time dependent distribution function over a large energy range 0-3eV, throughout the device, as well as average quantities, require only 40 minutes CPU time on an Alpha workstation.

The function of documents - David Doermann; Rivlin,Ehud; Rosenfeld,Azriel (Image and Vision Computing, 1998)
The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author's job to design the document so that the information it contains can be interpreted accurately and efficiently. To do this, the author can make use of a set of stylistic tools. In this paper, we introduce the concept of document functionality, which attempts to describe the roles of documents and their components in the process of transferring information. A functional description of a document provides insight into the type of the document, into its intended uses, and into strategies for automatic document interpretation and retrieval.To demonstrate these ideas, we define a taxonomy of functional document components and show how functional descriptions can be used to reverse-engineer the intentions of the author, to navigate in document space, and to provide important contextual information to aid in interpretation.
Keywords: Document functionality; Information transfer

Genetic nomenclature for Trypanosoma and Leishmania. - Clayton, C; Adams, M; Almeida, R; Baltz, T; Barrett, M; Bastien, P; Belli, S; Beverley, S; Biteau, N; Blackwell, J; Blaineau, C; Boshart, M; et al. (Mol Biochem Parasitol, 1998)
Keywords: Animals; Leishmania; Terminology as Topic; Trypanosoma

Hybrid planning: An approach to integrating generative and case-based planning - desJardins, Marie; Francis,A.; Wolverton,M. (Working Notes of the AAAI-98 Workshop on Case-Based Reasoning Integrations, 1998)

The Indexing and Retrieval of Document Images: A Survey - Doermann, David (Computer Vision and Image Understanding, 1998)
The economic feasibility of maintaining large databases of document images has created a tremendous demand for robust ways to access and manipulate the information these images contain. In an attempt to move toward a paper-less office, large quantities of printed documents are often scanned and archived as images, without adequate index information. One way to provide traditional database indexing and retrieval capabilities is to fully convert the document to an electronic representation which can be indexed automatically. Unfortunately, there are many factors which prohibit complete conversion including high cost, low document quality, and the fact that many non-text components cannot be adequately represented in a converted form. In such cases, it can be advantageous to maintain a copy of and use the document in image form. In this paper, we provide a survey of methods developed by researchers to access and manipulate document images without the need for complete and accurate conversion. We briefly discuss traditional text indexing techniques on imperfect data and the retrieval of partially converted documents. This is followed by a more comprehensive review of techniques for the direct characterization, manipulation and retrieval of images of documents containing text, graphics and scene images.

Indexing and Retrieval of MPEG-compressed video - Kobla,V.; David Doermann (The Journal of Electronic Imaging, 1998)
To keep pace with the increased popularity of digital video as an archival medium, thedevelopment of techniques for fast and e cient analysis of video streams is essential. In particular, solutions to the problems of storing, indexing, browsing, and retrieving video data from large multimedia databases are necessary to allow access to these collections. Given that video is often stored e ciently in a compressed format, the costly overhead of decompression can be reduced by analyzing the compressed representation directly. In earlier work, we presented compressed domain parsing techniques which identi ed shots, subshots, and scenes. In this paper, we present e cient key frame selection, feature extraction, indexing, and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame type independent representation which normalizes spatial and temporal features including frame type, frame size, macroblock encoding, and motion compensation vectors. Features for indexing are derived directly from this representation and mapped to a low- dimensional space where they can be accessed using standard database techniques. Spatial information is used as primary index into the database and temporal information is used to rank retrieved clips and enhance the robustness of the system. The techniques presented enable e cient indexing, querying, and retrieval of compressed video as demonstrated by our system which typically takes a fraction of a second to retrieve similar video scenes from a database, with over 95% recall.

Lexical Allocation in Interlingua-Based Machine Translation of Spatial Expressions - Dorr, Bonnie J; Voss,C.R.; Sencan,M.U. (Representation and processing of spatial expressions, 1998)

Lexical Selection for Cross-Language Applications: Combining LCS with WordNet - Dorr, Bonnie J; Katsova,Maria (Machine Translation and the Information SoupMachine Translation and the Information Soup, 1998)
This paper describes experiments for testing the power of large-scale resources for lexical selection in machine translation (MT) and cross-language information retrieval (CLIR). We adopt the view that verbs with similar argument structure share certain meaning components, but that those meaning components are more relevant to argument realization than to idiosyncratic verb meaning. We verify this by demonstrating that verbs with similar argument structure as encoded in Lexical Conceptual Structure (LCS) are rarely synonymous in WordNet. We then use the results of this work to guide our implementation of an algorithm for cross-language selection of lexical items, exploiting the strengths of each resource: LCS for semantic structure and WordNet for semantic content. We use the Parka Knowledge-Based System to encode LCS representations and WordNet synonym sets and we implement our lexical-selection algorithm as Parka-based queries into a knowledge base containing both information types.

Modeling of particle motion in viscous swirl flow between two porous cylinders - Gumerov, Nail A.; Duraiswami, Ramani (Proc. ASME Fluids Engineering Division Summer Meeting, 1998)

Multiple mechanisms of immune evasion by African trypanosomes - Donelson,John E.; Hill,Kent L.; El‐Sayed, Najib M. (Molecular and Biochemical Parasitology, 1998)
During infection of a mammalian host, African trypanosomes are in constant contact with the host's immune system. These protozoan parasites are infamous for their ability to evade the immune responses by periodically switching their major variant surface glycoprotein (VSG), a phenomenon called antigenic variation. Antigenic variation, however, is likely to be only one of several mechanisms enabling these organisms to thrive in the face of the immune defenses. The ability to grow in high levels of interferon-gamma (IFN-[gamma]) and to avoid complement-mediated destruction may also facilitate the parasite's survival. In this review we summarize (i) the activation of trypanosome genes for three different VSGs during antigenic variation, (ii) the secretion of a trypanosome protein that induces host CD8+ T cells to produce IFN-[gamma], and (iii) the evidence for trypansome protein similar to a surface protease of Leishmania that plays a role in resistance to complement-mediated lysis.
Keywords: Leishmania; Recombinant cloning; T cell; Trypanosomes; VSG genes

Security for virtual private intranets - Arbaugh, William A.; Davin,J. R; Farber,D. J; Smith,J. M (Computer, 1998)
As telecommuting grows, businesses must consider security when extending their network environment to employees' homes. Researchers at the University of Pennsylvania have addressed the problem with smart cards, operating system modifications, and network authentication. We note the distinction between trust and integrity: trust is determined through the verification of components and the dependencies among them, while integrity demonstrates that components haven't been modified. Thus integrity checking in a trustworthy system is about preserving an established trust or trust relationship. Our solution to the challenge of isolating functional roles that may share a single hardware platform is called secure identity based lending (SIBL). SIBL provides multiple personalities by partitioning the hard drive into n+1 partitions, where n is the number of supported personalities. All personalities use the system partition for core operating system components and shared applications. Each of the personalities is also associated with one of the remaining partitions, which are encrypted using a symmetric algorithm
Keywords: businesses; Clouds; Companies; core operating system components; cryptography; Data security; employee homes; encryption; functional roles; hard drive; Home computing; home working; integrity checking; Internet; Local area networks; multiple personalities; network authentication; network environment; operating system modifications; Operating systems; Roads; secure identity based lending; security management; security of data; shared applications; SIBL; single hardware platform; smart cards; symmetric algorithm; system partition; telecommuting; Teleworking; trust relationship; trustworthy system; virtual private intranets

A Survey of Current Paradigms in Machine Translation - Dorr, Bonnie J; Jordan,P.W.; Benoit,J.W. (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 1998)
This is paper is a survey of the current machine translation research in the US, Eu-rope, and Japan. A short history of machine translation is presented first, followed by an overview of the current research work. Representative examples of a wide range of different approaches adopted by machine translation researchers are presented. These are described in detail along with a discussion of the practicalities of scaling up these approaches for operational environments. In support of this discussion, issues in, and techniques for, evaluating machine translation systems are discussed.

A Survey of Multilingual Text Retrieval - Oard, Douglas; Dorr, Bonnie J (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 1998)
This report reviews the present state of the artin selection of texts in one language based on queries in another, a problem we refer to as ``multilingual'' text retrieval. Present applications of multilingual text retrieval systems are limited by the cost and complexity of developing and using the multilingual thesauri on which they are based and by the level of user training that is required to achieve satisfactory search effectiveness. A general model for multilingual text retrieval is used to review the development of the field and to describe modern production and experimental systems. The report concludes with some observations on the present state of the art and an extensive bibliography of the technical literature on multilingual text retrieval. The research reported herein was supported, in part, by Army Research Office contract DAAL03-91-C-0034 through Battelle Corporation, NSF NYI IRI-9357731, Alfred P. Sloan Research Fellow Award BR3336, and a General Research Board Semester Award. (Also cross-referenced as UMIACS-TR-96-19)
Keywords: Technical Report

Techniques for update handling in the enhanced client-server DBMS - Delis,A.; Roussopoulos, Nick (IEEE Transactions on Knowledge and Data Engineering, 1998)
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'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

Temporally determinate disk access (extended abstract): an experimental approach - Aboutabl,Mohamed; Agrawala, Ashok K.; Decotignie,Jean-Dominique (Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998)

Text Extraction and Recognition in Digital Video - Li,H.; David Doermann; Kia,O. (Proceedings of Third IAPRWorkshop on Document Analysis Systems, 1998)

A Thematic Hierarchy for Efficient Generation from Lexical-Conceptual Structure - Dorr, Bonnie J; Habash,Nizar; Traum,David (Machine Translation and the Information SoupMachine Translation and the Information Soup, 1998)
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.

Video Summarization by Curve Simplification - DeMenthon,Daniel; Kobla,Vikrant; David Doermann (University of Maryland, College Park, 1998)
A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.

Video Summarization by Curve Simplification - DeMenthon,D.; David Doermann; Kobla,V. (Proceedings of ACM - Multimedia 98, Bristol, England, 1998)
A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.

Walkthroughs of complex environments using image-based simplification - Darsa,L.; Costa,B.; Varshney, Amitabh (Computers & Graphics, 1998)
We present an image-based technique to accelerate the navigation in complex static environments. We perform an image-space simplification of each sample of the scene taken at a particular viewpoint and dynamically combine these simplified samples to produce images for arbitrary viewpoints. Since the scene is converted into a bounded complexity representation in the image space, with the base images rendered beforehand, the rendering speed is relatively insensitive to the complexity of the scene. The proposed method correctly simulates the kinetic depth effect (parallax), occlusion, and can resolve the missing visibility information. This paper describes a suitable representation for the samples, a specific technique for simplifying them, and different morphing methods for combining the sample information to reconstruct the scene. We use hardware texture mapping to implement the image-space warping and hardware affine transformations to compute the view-dependent warping function.
Keywords: image-based rendering, image morphing, virtual walkthroughs, visibility, image compositing

When Two Hands Are Better Than One: Enhancing Collaboration Using Single Display Groupware. CHI’98 - Stewart,J.; Raybourn,E.; Bederson, Benjamin B.; Druin, Allison (Extended Abstracts, 1998)

ADistributed Management System for Testing Document Image Database Analysis Algorithms - David Doermann; Sauvola,J.; Haapakoski,S.; Kauniskangas,H.; Seppanen,T.; Pietikainen,M. (ICDAR, 1997)

African trypanosomes have differentially expressed genes encoding homologues of the Leishmania GP63 surface protease - El‐Sayed, Najib M.; Donelson,J. E (Journal of Biological Chemistry, 1997)

Aspectual Modifications to a LCS Database for NLP Applications - Dorr, Bonnie J; Olsen,M.B. (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 1997)
Verbal and compositional lexical aspect provide the underlying temporal structure ofevents. Knowledge of lexical aspect, e.g., (a)telicity, is therefore required for interpret- ing event sequences in discourse (Dowty, 1986: Moens and Steedman, 1988; Passoneau, 1988), interfacing to temporal databases (Androutsopoulos, 1996), processing temporal modifiers (Antonisse, 1994), describing allowable alternations and their semantic effects (Resnik, 1996; Tenny, 1994), and selecting tense and lexical items for natural language generation ((Dorr and Olsen, 1996; Klavans and Chodorow, 1992), cf. (Slobin and Bo- caz, 1988)). We show that it is possible to represent lexical aspect—both verbal and compositional—on a large scale, using Lexical Conceptual Structure (LCS) representa- tions of verbs in the classes cataloged by Levin (1993). We show how proper consideration of these universal pieces of verb meaning may be used to refine lexical representations and derive a range of meanings from combinations of LCS representations. A single al- gorithm may therefore be used to determine lexical aspect classes and features at both verbal and sentence levels. Finally, we illustrate how knowledge of lexical aspect facili- tates the interpretation of events in NLP applications.

Automated manufacturability analysis: A survey - Gupta, Satyandra K.; Regli,William C.; Das,Diganta; Nau, Dana S. (Research in Engineering Design, 1997)
In the market-place of the 21st century, there is no place for traditional ‘over-the-wall’ communications between design and manufacturing. In order to ‘design it right the very first time’, designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool — enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.
Keywords: engineering

Compressed Domain video indexing techniques using DCT and motion vector information in MPEG video - Kobla,V.; David Doermann; Lin,K-I.; Faloutsos,C. (Proceedings of SPIE - conference on Storage and Retrieval for Image and Video Databases V, 1997)
Development of various multimedia applications hinges on the availability of fast and e cient storage, brows-ing, indexing, and retrieval techniques. Given that video is typically stored e ciently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where a video clip is divided into shots, subshots, and scenes. In this paper, we describe key frame selection, feature extraction, and indexing and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed with standard database techniques. The spatial information is used as primary index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiv- ing, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95% success.

Content-based Image Retrieval Using Composite Features - Kauniskangas,H.; Sauvola,J.; Pietikainen,M.; David Doermann (Proceedings of the 1997 Scandinavian Conference on Image Analysis, 1997)
In this paper, we demonstrate methods for content-based image retrieval problems utilizing a specially designed retrieval architecture implemented within the 'Intelligent Image Retrieval' system (IIR). The method consists of new image features in the retrieval context, including segmentation methods and use of image frames. They are combined in a unique way with color, texture, shape and localization information with a special data ion construction in a graphical user interface. The IIR system provides an efficient retrieval architecture utilizing a tailored query language, retrieval mechanisms and an object-oriented database enabling the use of complex data structures and relations needed for successful query processing. Functionality and performance of methods and architecture are illustrated with a series of tests using a database that consists of several hundred 'scene' images.

Deriving verbal and compositional lexical aspect for NLP applications - Dorr, Bonnie J; Olsen,Mari Broman (Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics, 1997)
Verbal and compositional lexical aspect provide the underlying temporal structure of events. Knowledge of lexical aspect, e.g., (a)telicity, is therefore required for interpreting event sequences in discourse (Dowty, 1986; Moens and Steedman, 1988; Passoneau, 1988), interfacing to temporal databases (Androutsopoulos, 1996), processing temporal modifiers (Antonisse, 1994), describing allowable alternations and their semantic effects (Resnik, 1996; Tenny, 1994), and selecting tense and lexical items for natural language generation ((Dorr and Olsen, 1996; Klavans and Chodorow, 1992), cf. (Slobin and Bocaz, 1988)). We show that it is possible to represent lexical aspect---both verbal and compositional---on a large scale, using Lexical Conceptual Structure (LCS) representations of verbs in the classes cataloged by Levin (1993). We show how proper consideration of these universal pieces of verb meaning may be used to refine lexical representations and derive a range of meanings from combinations of LCS representations. A single algorithm may therefore be used to determine lexical aspect classes and features at both verbal and sentence levels. Finally, we illustrate how knowledge of lexical aspect facilitates the interpretation of events in NLP applications.

Designing interactive multimedia (panel) - Scarlatos,Lori L.; Darken,Rudolph P.; Harada,Komei; Heeter,Carrie; Muller,Richard; Shneiderman, Ben (Proceedings of the fifth ACM international conference on Multimedia, 1997)

The Detection of Duplicates in Document Image Databases - David Doermann; Li,H.; Kia,O. (ICDAR, 1997)
The problem of off-line handwritten character recognition has eluded a satisfactory solution for several decades. Researchers working in the area of on-line recognition have had greater success, but the possibility of extracting on-line information from static images has not been fully explored. The experience of forensic document examiners assures us that in many cases, such information can be successfully recovered.We outline the design of a system for the recovery of temporal information from static handwritten images. We provide a taxonomy of local, regional and global temporal clues which are often found in hand-written samples, and describe methods for recovering these clues from the image. We show how this system can benefit from obtaining a comprehensive understanding of the handwriting signal and a detailed analysis of stroke and sub-stroke properties. We suggest that the recovery task requires that we break away from traditional thresholding and thinning techniques, and we provide a framework for such analysis. We demonstrate how isolated temporal clues can reliably be extracted from this framework and propose a control structure for integrating the partial information. We show how many seemingly ambiguous situations can be resolved by the derived clues and our knowledge of the writing process, and provide several examples to illustrate our approach. The support of this research by the Ricoh Corporation is gratefully acknowledged.

Development of an object oriented parser/generator, ontologies, and privative aspectual features for interlingual lexical conceptual structures - Dorr, Bonnie J (University of Maryland at College Park, 1997)

Document Understanding - 1996 - David Doermann (University of Maryland, College Park, 1997)
This report contains nearly 340 references which are directly related to the field of document image understanding and appeared in major journals and conferences during 1996. Each reference is classified by major topic. Areas covered include, but are not limited to, preprocessing, models and representations, on-line recognition, off-line recognition, graphics recognition and interpretation, page processing, post-processing and special applications.

Enabling virtual reality for large-scale mechanical CAD datasets - Varshney, Amitabh; El-Sana,J.; Evans,F.; Darsa,L.; Costa,B.; Skiena,S. (Proceedings of ASME Design Engineering Technical Conferences, Sept, 1997)
Reconciling scene realism with interactivity has emerged asone of the most important areas in making virtual reality fea- sible for large-scale mechanical CAD datasets consisting of sev- eral millions of primitives. This paper surveys our research and related work for achieving interactivity without sacrificing real- ism in virtual reality walkthroughs and flythroughs of polygonal CAD datasets. We outline our recent work on efficient genera- tion of triangle strips from polygonal models that takes advan- tage of compression of connectivity information. This results in substantial savings in rendering, transmission, and storage. We outline our work on genus-reducing simplifications as well as real-time view-dependent simplifications that allow on-the-fly selection amongst multiple levels of detail, based upon lighting and viewing parameters. Our method allows multiple levels of detail to coexist on the same object at different regions and to merge seamlessly without any cracks or shading artifacts. We also present an overview of our work on hardware-assisted image- based rendering that allows interactive exploration of computer- generated scenes.

The evolution of plant nuclear genes - Clegg,M. T; Cummings, Michael P.; Durbin,M. L (Proc Natl Acad Sci USA, 1997)
We analyze the evolutionary dynamics of three of the best-studied plant nuclear multigene families. The data analyzed derive from the genes that encode the small subunit of ribulose-1,5-bisphosphate carboxylase (rbcS), the gene family that encodes the enzyme chalcone synthase (Chs), and the gene family that encodes alcohol dehydrogenases (Adh). In addition, we consider the limited evolutionary data available on plant transposable elements. New Chs and rbcS genes appear to be recruited at about 10 times the rate estimated for Adh genes, and this is correlated with a much smaller average gene family size for Adh genes. In addition, duplication and divergence in function appears to be relatively common for Chs genes in flowering plant evolution. Analyses of synonymous nucleotide substitution rates for Adh genes in monocots reject a linear relationship with clock time. Replacement substitution rates vary with time in a complex fashion, which suggests that adaptive evolution has played an important role in driving divergence following gene duplication events. Molecular population genetic studies of Adh and Chs genes reveal high levels of molecular diversity within species. These studies also reveal that inter- and intralocus recombination are important forces in the generation allelic novelties. Moreover, illegitimate recombination events appear to be an important factor in transposable element loss in plants. When we consider the recruitment and loss of new gene copies, the generation of allelic diversity within plant species, and ectopic exchange among transposable elements, we conclude that recombination is a pervasive force at all levels of plant evolution.

Extracting Features for Indexing MPEG-Compressed Video - Kobla,V.; David Doermann (Proceedings of the IEEEFirst Workshop on Multimedia Signal Processing, 1997)

The Function of Documents - David Doermann; Rosenfeld, A.; Rivlin,E. (ICDAR, 1997)
The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author's job to design the document so that the information it contains can be interpreted accurately and efficiently. To do this, the author can make use of a set of stylistic tools. In this paper we introduce the concept of document functionality, which attempts to describe the roles of documents and their components in the process of transferring information. A functional description of a document provides insight into the type of the document, into its intended uses, and into strategies for automatic document interpretation and retrieval. To demonstrate these ideas, we define a taxonomy of functional document components and show how functional descriptions can be used to reverse-engineer the intentions of the author, to navigate in document space, and to provide important contextual information to aid in interpretation.