@conference {14227,
	title = {Learning shift-invariant sparse representation of actions},
	booktitle = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
	year = {2010},
	month = {2010/06/13/18},
	pages = {2630 - 2637},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A central problem in the analysis of motion capture (MoCap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should facilitate the recognition, synthesis, and characterization of actions. We propose an unsupervised learning algorithm for automatically decomposing joint movements in human motion capture (MoCap) sequences into shift-invariant basis functions. Our formulation models the time series data of joint movements in actions as a sparse linear combination of short basis functions (snippets), which are executed (or {\textquotedblleft}activated{\textquotedblright}) at different positions in time. Given a set of MoCap sequences of different actions, our algorithm finds the decomposition of MoCap sequences in terms of basis functions and their activations in time. Using the tools of L1 minimization, the procedure alternately solves two large convex minimizations: Given the basis functions, a variant of Orthogonal Matching Pursuit solves for the activations, and given the activations, the Split Bregman Algorithm solves for the basis functions. Experiments demonstrate the power of the decomposition in a number of applications, including action recognition, retrieval, MoCap data compression, and as a tool for classification in the diagnosis of Parkinson (a motion disorder disease).},
	keywords = {action characterization, Action recognition, action retrieval, action synthesis, Character recognition, data compression, human motion capture, HUMANS, Image matching, Image motion analysis, image representation, Image sequences, Information retrieval, joint movements, large convex minimizations, learning (artificial intelligence), learning shift-invariant sparse representation, Matching pursuit algorithms, minimisation, Minimization methods, MoCap data compression, Motion analysis, motion capture analysis, motion disorder disease, motion sequences, orthogonal matching pursuit, Parkinson diagnosis, Parkinson{\textquoteright}s disease, Pursuit algorithms, shift-invariant basis functions, short basis functions, snippets, sparse linear combination, split Bregman algorithm, time series, time series data, Unsupervised learning, unsupervised learning algorithm},
	isbn = {978-1-4244-6984-0},
	doi = {10.1109/CVPR.2010.5539977},
	author = {Li,Yi and Ferm{\"u}ller, Cornelia and Aloimonos, J. and Hui Ji}
}
@conference {17162,
	title = {Finding comparable temporal categorical records: A similarity measure with an interactive visualization},
	booktitle = {IEEE Symposium on Visual Analytics Science and Technology, 2009. VAST 2009},
	year = {2009},
	month = {2009/10/12/13},
	pages = {27 - 34},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An increasing number of temporal categorical databases are being collected: Electronic Health Records in healthcare organizations, traffic incident logs in transportation systems, or student records in universities. Finding similar records within these large databases requires effective similarity measures that capture the searcher{\textquoteright}s intent. Many similarity measures exist for numerical time series, but temporal categorical records are different. We propose a temporal categorical similarity measure, the M\&M (Match \& Mismatch) measure, which is based on the concept of aligning records by sentinel events, then matching events between the target and the compared records. The M\&M measure combines the time differences between pairs of events and the number of mismatches. To accom-modate customization of parameters in the M\&M measure and results interpretation, we implemented Similan, an interactive search and visualization tool for temporal categorical records. A usability study with 8 participants demonstrated that Similan was easy to learn and enabled them to find similar records, but users had difficulty understanding the M\&M measure. The usability study feedback, led to an improved version with a continuous timeline, which was tested in a pilot study with 5 participants.},
	keywords = {data visualisation, Educational institutions, Feedback, Information retrieval, interactive search tool, interactive systems, interactive visualization tool, large databases, M\&M Measure, Match \& Mismatch measure, Medical services, numerical time series, parameters customization, Particle measurements, Similan, similarity measure, Similarity Search, temporal categorical databases, Temporal Categorical Records, temporal databases, Testing, Time measurement, time series, transportation, usability, very large databases, visual databases, Visualization},
	isbn = {978-1-4244-5283-5},
	doi = {10.1109/VAST.2009.5332595},
	author = {Wongsuphasawat,K. and Shneiderman, Ben}
}
@conference {14251,
	title = {Real-time shape retrieval for robotics using skip Tri-Grams},
	booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. IROS 2009},
	year = {2009},
	month = {2009/10/10/15},
	pages = {4731 - 4738},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The real time requirement is an additional constraint on many intelligent applications in robotics, such as shape recognition and retrieval using a mobile robot platform. In this paper, we present a scalable approach for efficiently retrieving closed contour shapes. The contour of an object is represented by piecewise linear segments. A skip Tri-Gram is obtained by selecting three segments in the clockwise order while allowing a constant number of segments to be {\~A}{\^A}{\textquestiondown}skipped{\~A}{\^A}{\textquestiondown} in between. The main idea is to use skip Tri-Grams of the segments to implicitly encode the distant dependency of the shape. All skip Tri-Grams are used for efficiently retrieving closed contour shapes without pairwise matching feature points from two shapes. The retrieval is at least an order of magnitude faster than other state-of-the-art algorithms. We score 80\% in the Bullseye retrieval test on the whole MPEG 7 shape dataset. We further test the algorithm using a mobile robot platform in an indoor environment. 8 objects are used for testing from different viewing directions, and we achieve 82\% accuracy.},
	keywords = {Bullseye retrieval test, Clocks, closed contour shape retrieval, Image retrieval, Image segmentation, Indexing, Information retrieval, Intelligent robots, Jacobian matrices, mobile robot, Mobile robots, MPEG 7 shape dataset, piecewise linear segments, Piecewise linear techniques, Real time systems, real-time shape retrieval, robot vision, SHAPE, shape recognition, shape representation, skip Tri-Grams, Testing},
	isbn = {978-1-4244-3803-7},
	doi = {10.1109/IROS.2009.5354738},
	author = {Li,Yi and Bitsakos,K. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {15856,
	title = {Replication and automation of expert judgments: Information engineering in legal e-discovery},
	booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2009. SMC 2009},
	year = {2009},
	month = {2009/10/11/14},
	pages = {102 - 107},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The retrieval of digital evidence responsive to discovery requests in civil litigation, known in the United States as {\~A}{\^A}{\textquestiondown}e-discovery,{\~A}{\^A}{\textquestiondown} presents several important and understudied conditions and challenges. Among the most important of these are (i) that the definition of responsiveness that governs the search effort can be learned and made explicit through effective interaction with the responding party, (ii) that the governing definition of responsiveness is generally complex, deriving both from considerations of subject-matter relevance and from considerations of litigation strategy, and (iii) that the result of the search effort is a set (rather than a ranked list) of documents, and sometimes a quite large set, that is turned over to the requesting party and that the responding party certifies to be an accurate and complete response to the request. This paper describes the design of an {\~A}{\^A}{\textquestiondown}interactive task{\~A}{\^A}{\textquestiondown} for the text retrieval conference{\textquoteright}s legal track that had the evaluation of the effectiveness of e-discovery applications at the {\~A}{\^A}{\textquestiondown}responsive review{\~A}{\^A}{\textquestiondown} task as its goal. Notable features of the 2008 interactive task were high-fidelity human-system task modeling, authority control for the definition of {\~A}{\^A}{\textquestiondown}responsiveness,{\~A}{\^A}{\textquestiondown} and relatively deep sampling for estimation of type 1 and type 2 errors (expressed as {\~A}{\^A}{\textquestiondown}precision{\~A}{\^A}{\textquestiondown} and {\~A}{\^A}{\textquestiondown}recall{\~A}{\^A}{\textquestiondown}). The paper presents a critical assessment of the strengths and weaknesses of the evaluation design from the perspectives of reliability, reusability, and cost-benefit tradeoffs.},
	keywords = {authorisation, authority control, Automation, civil litigation, CYBERNETICS, Delay, digital evidence retrieval, discovery request, Educational institutions, expert judgment automation, Human computer interaction, Human-machine cooperation and systems, human-system task modeling, information engineering, Information retrieval, interactive task, Law, law administration, legal e-discovery, Legal factors, PROBES, Production, Protocols, search effort, Search methods, text analysis, text retrieval conference legal track, United States, USA Councils, User modeling},
	isbn = {978-1-4244-2793-2},
	doi = {10.1109/ICSMC.2009.5346118},
	author = {Hedin,B. and Oard, Douglas}
}
@conference {18347,
	title = {Multimodal question answering for mobile devices},
	booktitle = {Proceedings of the 13th international conference on Intelligent user interfaces},
	series = {IUI {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {405 - 408},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper introduces multimodal question answering, a new interface for community-based question answering services. By offering users an extra modality---photos---in addition to the text modality to formulate queries, multimodal question answering overcomes the limitations of text-only input methods when the users ask questions regarding visually distinctive objects. Such interface is especially useful when users become curious about an interesting object in the environment and want to know about it---simply by taking a photo and asking a question in a situated (from a mobile device) and intuitive (without describing the object in words) manner. We propose a system architecture for multimodal question answering, describe an algorithm for searching the database, and report on the findings of two prototype studies.},
	keywords = {Information retrieval, mobile application, pattern matching, Question answering},
	isbn = {978-1-59593-987-6},
	doi = {10.1145/1378773.1378841},
	url = {http://doi.acm.org/10.1145/1378773.1378841},
	author = {Tom Yeh and Darrell,Trevor}
}
@conference {18350,
	title = {Photo-based question answering},
	booktitle = {Proceedings of the 16th ACM international conference on Multimedia},
	series = {MM {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {389 - 398},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Photo-based question answering is a useful way of finding information about physical objects. Current question answering (QA) systems are text-based and can be difficult to use when a question involves an object with distinct visual features. A photo-based QA system allows direct use of a photo to refer to the object. We develop a three-layer system architecture for photo-based QA that brings together recent technical achievements in question answering and image matching. The first, template-based QA layer matches a query photo to online images and extracts structured data from multimedia databases to answer questions about the photo. To simplify image matching, it exploits the question text to filter images based on categories and keywords. The second, information retrieval QA layer searches an internal repository of resolved photo-based questions to retrieve relevant answers. The third, human-computation QA layer leverages community experts to handle the most difficult cases. A series of experiments performed on a pilot dataset of 30,000 images of books, movie DVD covers, grocery items, and landmarks demonstrate the technical feasibility of this architecture. We present three prototypes to show how photo-based QA can be built into an online album, a text-based QA, and a mobile application.},
	keywords = {Computer vision, Information retrieval, Question answering},
	isbn = {978-1-60558-303-7},
	doi = {10.1145/1459359.1459412},
	url = {http://doi.acm.org/10.1145/1459359.1459412},
	author = {Tom Yeh and Lee,John J and Darrell,Trevor}
}
@conference {15062,
	title = {A topic-based Document Correlation Model},
	booktitle = {Machine Learning and Cybernetics, 2008 International Conference on},
	volume = {5},
	year = {2008},
	month = {2008/07//},
	pages = {2487 - 2491},
	abstract = {Document correlation analysis is now a focus of study in text mining. This paper proposed a Document Correlation Model to capture the correlation between documents from topic level. The model represents the document correlation as the Optimal Matching of a bipartite graph, of which each partition is a document, each node is a topic, and each edge is the similarity between two topics. The topics of each document are retrieved by the Latent Dirichlet Allocation model and Gibbs sampling. Experiments on correlated document search show that the Document Correlation Model outperforms the Vector Space Model on two aspects: 1) it has higher average retrieval precision; 2) it needs less space to store a documentpsilas information.},
	keywords = {bipartite graph optimal matching, data mining, document correlation analysis, document retrieval, Gibbs sampling, Information retrieval, latent Dirichlet allocation model, text analysis, text mining, topic-based document correlation model},
	doi = {10.1109/ICMLC.2008.4620826},
	author = {Jia,Xi-Ping and Peng,Hong and Zheng,Qi-Lun and Zhuolin Jiang and Li,Zhao}
}
@article {15790,
	title = {QCS: A system for querying, clustering and summarizing documents},
	journal = {Information Processing \& Management},
	volume = {43},
	year = {2007},
	month = {2007/11//},
	pages = {1588 - 1605},
	abstract = {Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel integrated information retrieval system{\textemdash}the Query, Cluster, Summarize (QCS) system{\textemdash}which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of methods in the QCS design improves retrievals by providing users more focused information organized by topic.We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) as measured by the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines.
Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence {\textquotedblleft}trimming{\textquotedblright} and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format.
Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.
},
	keywords = {clustering, Information retrieval, latent semantic indexing, Sentence trimming, Summarization, TEXT PROCESSING},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2007.01.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307000246},
	author = {Dunlavy,Daniel M. and O{\textquoteright}Leary,Dianne P. and Conroy,John M. and Schlesinger,Judith D.}
}
@conference {16462,
	title = {Exploiting multiple paths to express scientific queries},
	booktitle = {16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings},
	year = {2004},
	month = {2004/06/21/23},
	pages = {357 - 360},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The purpose of this demonstration is to present the main features of the BioNavigation system. Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a succession of Web resources following links between retrieved entries. Each of the steps provides part of the intended characterization of the scientific object. This process is sometimes partially supported by hard-coded scripts or complex queries that will be evaluated by a mediation-based data integration system or against a data warehouse. These approaches fail in guiding the scientists during the collection process. In contrast, the BioNavigation approach presented in the paper provides the scientists with information on the available alternative resources, their provenance, and the costs of data collection. The BioNavigation system enhances a mediation-based integration system and provides scientists with support for the following: to ask queries at a high conceptual level; to visualize the multiple alternative resources that may be exploited to execute their data collection queries; to choose the final execution path to evaluate their queries.},
	keywords = {access protocols, biology computing, BioNavigation system, complex queries, Costs, Data analysis, data handling, Data visualization, data warehouse, Data warehouses, Databases, diseases, distributed databases, hard-coded scripts, information resources, Information retrieval, mediation-based data integration system, multiple paths, query evaluation, Query processing, scientific data collection, scientific discovery, scientific information, scientific information systems, scientific object of interest, scientific queries, sequences, Web resources},
	isbn = {0-7695-2146-0},
	doi = {10.1109/SSDM.2004.1311231},
	author = {Lacroix,Z. and Moths,T. and Parekh,K. and Raschid, Louiqa and Vidal,M. -E}
}
@article {13771,
	title = {Extrinsic Evaluation of Automatic Metrics for Summarization},
	year = {2004},
	month = {2004/07/20/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper describes extrinsic-task evaluation of summarization. We show that it is possible to save time using summaries for relevance assessment without adversely impacting the degree of accuracy that would be possible with full documents. In addition, we demonstrate that the extrinsic task we have selected exhibits a high degree of interannotator agreement, i.e., consistent relevance decisions across subjects. We also conducted a composite experiment that better reflects the actual document selection process and found that using a surrogate improves the processing speed over reading the entire document. Finally, we have found a small yet statistically significant correlation between some of the intrinsic measures and a user{\textquoteright}s performance in an extrinsic task. The overall conclusion we can draw at this point is that ROUGE-1 does correlate with precision and to a somewhat lesser degree with accuracy, but that it remains to be investigated how stable these correlations are and how differences in ROUGE-1 translate into significant differences in human performance in an extrinsic task.},
	keywords = {*ABSTRACTS, *ACCURACY, *DATA SUMMARIZATION, *DOCUMENT SUMMARIES, *DOCUMENTS, *READING MACHINES, *SOFTWARE METRICS, *STATISTICAL ANALYSIS, ABSTRACT SELECTION, ANNOTATIONS, Automation, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, CORRELATION TECHNIQUES, DATA PROCESSING, DOCUMENT SUMMARIES, EXTRINSIC TASKS, Information retrieval, INFORMATION SCIENCE, PERFORMANCE(HUMAN), PRECISION, RELEVANCY, ROUGE-1 COMPUTER PROGRAM, STATISTICS AND PROBABILITY, TEST AND EVALUATION},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA448065},
	author = {Dorr, Bonnie J and Monz,Christof and Oard, Douglas and President,Stacy and Zajic, David and Schwartz,Richard}
}
@article {13886,
	title = {Use of Minimal Lexical Conceptual Structures for Single-Document Summarization},
	year = {2004},
	month = {2004/06//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This reports provides an overview of the findings and software that have evolved from the Use of Minimal Lexical Conceptual Structures for Single-Document Summarization project over the last six months. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.},
	keywords = {*COMPUTATIONAL LINGUISTICS, AUTOMATIC HEADLINE GENERATION, CYBERNETICS, DOCUMENT SUMMARIZATION, Information retrieval, INFORMATION SCIENCE, linguistics, Machine translation},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458797},
	author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof and Schwartz,Richard}
}
@conference {15840,
	title = {The effect of bilingual term list size on dictionary-based cross-language information retrieval},
	booktitle = {Proceedings of the 36th Annual Hawaii International Conference on System Sciences, 2003},
	year = {2003},
	month = {2003/01/06/9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Bilingual term lists are extensively used as a resource for dictionary-based cross-language information retrieval (CLIR), in which the goal is to find documents written in one natural language based on queries that are expressed in another. This paper identifies eight types of terms that affect retrieval effectiveness in CLIR applications through their coverage by general-purpose bilingual term lists, and reports results from an experimental evaluation of the coverage of 35 bilingual term lists in news retrieval application. Retrieval effectiveness was found to be strongly influenced by term list size for lists that contain between 3,000 and 30,000 unique terms per language. Supplemental techniques for named entity translation were found to be useful with even the largest lexicons. The contribution of named-entity translation was evaluated in a cross-language experiment involving English and Chinese. Smaller effects were observed from deficiencies in the coverage of domain-specific terminology when searching news stories.},
	keywords = {bilingual term list, Chinese language, Computer science, Control systems, Cross-language information retrieval, data mining, Dictionaries, dictionary-based information retrieval, Educational institutions, English language, Frequency, Information retrieval, language translation, named-entity translation, natural languages, Surface morphology, Terminology},
	isbn = {0-7695-1874-5},
	doi = {10.1109/HICSS.2003.1174250},
	author = {Demner-Fushman,D. and Oard, Douglas}
}
@article {17849,
	title = {The virtual microscope},
	journal = {IEEE Transactions on Information Technology in Biomedicine},
	volume = {7},
	year = {2003},
	month = {2003/12//},
	pages = {230 - 248},
	abstract = {We present the design and implementation of the virtual microscope, a software system employing a client/server architecture to provide a realistic emulation of a high power light microscope. The system provides a form of completely digital telepathology, allowing simultaneous access to archived digital slide images by multiple clients. The main problem the system targets is storing and processing the extremely large quantities of data required to represent a collection of slides. The virtual microscope client software runs on the end user{\textquoteright}s PC or workstation, while database software for storing, retrieving and processing the microscope image data runs on a parallel computer or on a set of workstations at one or more potentially remote sites. We have designed and implemented two versions of the data server software. One implementation is a customization of a database system framework that is optimized for a tightly coupled parallel machine with attached local disks. The second implementation is component-based, and has been designed to accommodate access to and processing of data in a distributed, heterogeneous environment. We also have developed caching client software, implemented in Java, to achieve good response time and portability across different computer platforms. The performance results presented show that the Virtual Microscope systems scales well, so that many clients can be adequately serviced by an appropriately configured data server.},
	keywords = {biomedical optical imaging, client software, client/server architecture, Computer architecture, Computer Graphics, computer platforms, Computer simulation, Concurrent computing, configured data server, data server software, database management systems, database software, Database systems, digital slide images, digital telepathology, diseases, emulation, Environment, Equipment Design, Equipment Failure Analysis, high power light microscope, Image databases, Image Enhancement, Image Interpretation, Computer-Assisted, Image retrieval, Information retrieval, Information Storage and Retrieval, java, local disks, microscope image data, Microscopy, multiple clients, optical microscopy, PACS, software, Software design, software system, Software systems, Systems Integration, Telepathology, User-Computer Interface, virtual microscope design, Virtual reality, Workstations},
	isbn = {1089-7771},
	doi = {10.1109/TITB.2004.823952},
	author = {Catalyurek,U. and Beynon,M. D and Chang,Chialin and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@conference {15893,
	title = {Term selection for searching printed Arabic},
	booktitle = {Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {261 - 268},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Since many Arabic documents are available only in print, automating retrieval from collections of scanned Arabic document images using Optical Character Recognition (OCR) is an interesting problem. Arabic combines rich morphology with a writing system that presents unique challenges to OCR systems. These factors must be considered when selecting terms for automatic indexing. In this paper, alternative choices of indexing terms are explored using both an existing electronic text collection and a newly developed collection built from images of actual printed Arabic documents. Character n-grams or lightly stemmed words were found to typically yield near-optimal retrieval effectiveness, and combining both types of terms resulted in robust performance across a broad range of conditions.},
	keywords = {arabic, Information retrieval, OCR, term selection},
	isbn = {1-58113-561-0},
	doi = {10.1145/564376.564423},
	url = {http://doi.acm.org/10.1145/564376.564423},
	author = {Darwish,Kareem and Oard, Douglas}
}
@article {17842,
	title = {Visualization of large data sets with the Active Data Repository},
	journal = {IEEE Computer Graphics and Applications},
	volume = {21},
	year = {2001},
	month = {2001/08//Jul},
	pages = {24 - 33},
	abstract = {We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine},
	keywords = {active data repository, ADR runtime system, Algorithm design and analysis, application-specific processing, C++, data mining, data retrieval, data visualisation, Data visualization, distributed-memory parallel machines, Indexing, Information retrieval, isosurface rendering, Isosurfaces, large data sets, large-scale multidimensional data, Memory management, modular services, out-of-core data sets, parallel machine, Parallel machines, Partitioning algorithms, ray-casting-based volume rendering, Rendering (computer graphics), Runtime, software libraries, storage management},
	isbn = {0272-1716},
	doi = {10.1109/38.933521},
	author = {Kurc, T. and Catalyurek,U. and Chang,Chialin and Sussman, Alan and Saltz, J.}
}
@article {13809,
	title = {Large-Scale Construction of a Chinese-English Semantic Hierarchy},
	year = {2000},
	month = {2000/04//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {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},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458682},
	author = {Dorr, Bonnie J and Levow,Gina-Anne and Lin,Dekang}
}
@article {17617,
	title = {Low discrepancy sets yield approximate min-wise independent permutation families},
	journal = {Information Processing Letters},
	volume = {73},
	year = {2000},
	month = {2000/01/31/},
	pages = {29 - 32},
	abstract = {Motivated by a problem of filtering near-duplicate Web documents, Broder, Charikar, Frieze and Mitzenmacher defined the following notion of ϵ-approximate min-wise independent permutation families. A multiset F of permutations of {0,1,{\textellipsis},n-1} is such a family if for all K⫅{0,1,{\textellipsis},n-1} and any x∈K, a permutation π chosen uniformly at random from F satisfies |Pr[min{π(K)}=π(x)]-1|K||<=ϵ|K|. We show connections of such families with low discrepancy sets for geometric rectangles, and give explicit constructions of such families F of size nO(logn) for ϵ=1/nΘ(1), improving upon the previously best-known bound of Indyk. We also present polynomial-size constructions when the min-wise condition is required only for |K|<=2O(log2/3n), with ϵ>=2-O(log2/3n).},
	keywords = {combinatorial problems, Document filtering, explicit constructions, Information retrieval, Min-wise independent permutations, Pseudorandom permutations},
	isbn = {0020-0190},
	doi = {10.1016/S0020-0190(99)00163-5},
	url = {http://www.sciencedirect.com/science/article/pii/S0020019099001635},
	author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu and Zuckerman,David}
}
@conference {17880,
	title = {Optimizing retrieval and processing of multi-dimensional scientific datasets},
	booktitle = {Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International},
	year = {2000},
	month = {2000///},
	pages = {405 - 410},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We have developed the Active Data Repository (ADR), an infrastructure that integrates storage, retrieval, and processing of large multi-dimensional scientific datasets on distributed memory parallel machines with multiple disks attached to each node. In earlier work, we proposed three strategies for processing range queries within the ADR framework. Our experimental results show that the relative performance of the strategies changes under varying application characteristics and machine configurations. In this work we investigate approaches to guide and automate the selection of the best strategy for a given application and machine configuration. We describe analytical models to predict the relative performance of the strategies where input data elements are uniformly distributed in the attribute space of the output dataset, restricting the output dataset to be a regular d-dimensional array},
	keywords = {active data repository, Area measurement, Computer science, Data analysis, distributed memory parallel machines, Educational institutions, Information retrieval, Information Storage and Retrieval, infrastructure, Microscopy, Microwave integrated circuits, multi-dimensional scientific datasets retrieval, PARALLEL PROCESSING, Pathology, range queries, regular d-dimensional array, Satellites, Tomography},
	isbn = {0-7695-0574-0},
	doi = {10.1109/IPDPS.2000.846013},
	author = {Chang,Chialin and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@conference {17386,
	title = {Supporting creativity with powerful composition tools for artifacts and performances},
	booktitle = {Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000},
	year = {2000},
	month = {2000/01/04/7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Modern software such as word processors, slide preparation/presentation tools, or music composition packages are designed to produce artifacts or performances. Now, some designers are expanding their goals to include creativity support into their software. This essay builds on the genex framework for creativity, which has four phases and eight activities. It focuses on the composition activity by considering tools to support initiation, revision, and evaluation. Some existing tools provide partial support that suggests ways in which to develop more ambitious low, middle, and high level tools. The goal is to enable more people to be more creative more of the time.},
	keywords = {artifacts, Artificial intelligence, composition tools, Computer science, Context modeling, creativity, creativity support, Educational institutions, Information retrieval, Laboratories, Manufacturing, music composition, performances, Software design, software libraries, software tools, US Department of Transportation},
	isbn = {0-7695-0493-0},
	doi = {10.1109/HICSS.2000.926896},
	author = {Shneiderman, Ben}
}
@conference {15889,
	title = {Effects of term segmentation on Chinese/English cross-language information retrieval},
	booktitle = {String Processing and Information Retrieval Symposium, 1999 and International Workshop on Groupware},
	year = {1999},
	month = {1999///},
	pages = {149 - 157},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The majority of recent Cross-Language Information Retrieval (CLIR) research has focused on European languages. CLIR problems that involve East Asian languages such as Chinese introduce additional challenges, because written Chinese texts lack boundaries between terms. The paper examines three Chinese segmentation techniques in combination with two variants of dictionary-based Chinese to English query translation. The results indicate that failure to segment terms, particularly technical terms and names, can have a cascading effect that reduces retrieval effectiveness. Task-tuned segmentation algorithms and alternative term weighting strategies are suggested as productive directions for future work},
	keywords = {alternative term weighting strategies, cascading effect, Chinese segmentation techniques, Chinese/English cross-language information retrieval, Chromium, CLIR problems, Cross-Language Information Retrieval research, data mining, Dictionaries, dictionary-based Chinese, East Asian languages, English query translation, European languages, future work, Information retrieval, language translation, linguistics, natural language processing, natural languages, productive directions, Reactive power, retrieval effectiveness, task-tuned segmentation algorithms, technical terms, term segmentation, text analysis, written Chinese texts},
	isbn = {0-7695-0268-7},
	doi = {10.1109/SPIRE.1999.796590},
	author = {Oard, Douglas and Wang,Jianqiang}
}
@article {16925,
	title = {A framework for search interfaces},
	journal = {IEEE Software},
	volume = {14},
	year = {1997},
	month = {1997/04//Mar},
	pages = {18 - 20},
	abstract = {Searching textual databases can be confusing for users. Popular search systems for the World Wide Web and stand alone systems typically provide a simple interface: users type in keywords and receive a relevance ranked list of 10 results. This is appealing in its simplicity, but users are often frustrated because search results are confusing or aspects of the search are out of their control. If we are to improve user performance, reduce mistaken assumptions, and increase successful searches, we need more predictable design. To coordinate design practice, we suggest a four-phase framework that would satisfy first time, intermittent, and frequent users accessing a variety of textual and multimedia libraries},
	keywords = {Abstracts, Cities and towns, Databases, Delay, design practice, four-phase framework, frequent users, Information retrieval, Information services, Libraries, multimedia libraries, online front-ends, popular search systems, predictable design, Protection, relevance ranked list, search interfaces, search results, stand alone systems, textual database searching, Thesauri, User interfaces, user performance, word processing, World Wide Web},
	isbn = {0740-7459},
	doi = {10.1109/52.582969},
	author = {Shneiderman, Ben}
}
@conference {17335,
	title = {Query previews in networked information systems},
	booktitle = {Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96},
	year = {1996},
	month = {1996/05/13/15},
	pages = {120 - 129},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment},
	keywords = {Computer networks, data complexity, data mining, data patterns, data volume, dynamic query user interfaces, Educational institutions, EOS-DIS, exploratory method, Information retrieval, Information services, Information systems, Intelligent networks, interactive systems, Laboratories, Manipulator dynamics, matching data sets, NASA Earth Observing System-Data Information System, Network performance, networked environment, networked information systems, query formulation, query preview, query refinement, querying process, rough attribute values, User interfaces, visual databases, zero hit queries},
	isbn = {0-8186-7403-2},
	doi = {10.1109/ADL.1996.502522},
	author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {16204,
	title = {User controlled overviews of an image library: a case study of the visible human},
	booktitle = {Proceedings of the first ACM international conference on Digital libraries},
	series = {DL {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {74 - 82},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {Browsing, digital library, image database, information exploration, Information retrieval, Internet, medical image, remote access, user interface, Visualization, World-wide web},
	isbn = {0-89791-830-4},
	doi = {10.1145/226931.226946},
	url = {http://doi.acm.org/10.1145/226931.226946},
	author = {North,Chris and Shneiderman, Ben and Plaisant, Catherine}
}
@conference {13769,
	title = {Experimental investigation of high performance cognitive and interactive text filtering},
	booktitle = {, IEEE International Conference on Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century},
	volume = {5},
	year = {1995},
	month = {1995/10/22/25},
	pages = {4398-4403 vol.5 - 4398-4403 vol.5},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Text filtering has become increasingly important as the volume of networked information has exploded in recent years. This paper reviews recent progress in that field and reports on the development of a testbed for experimental investigation of cognitive and interactive text selection based on a history of user evaluations. An interactive filtering system model is presented and a new cognitive filtering technique which the authors call the Gaussian User Model is described. Because development of analytic measures of text selection effectiveness has proven intractable, the authors have modified the Cornell SMART text retrieval system to create a flexible text filtering testbed for experimental determination of filtering effectiveness. The paper concludes with a description of the design of this testbed system},
	keywords = {Cause effect analysis, Computer science, Contracts, Cornell SMART text retrieval system, Educational institutions, Gaussian User Model, high performance cognitive interactive text filtering, History, Information filtering, Information filters, Information retrieval, information retrieval system evaluation, Libraries, Matched filters, online front-ends, Query processing, System testing, text selection effectiveness, user evaluations, User interfaces, user modelling},
	isbn = {0-7803-2559-1},
	doi = {10.1109/ICSMC.1995.538486},
	author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C. and Marchionini,G.}
}
@conference {13837,
	title = {On automatic filtering of multilingual texts},
	booktitle = {, 1994 IEEE International Conference on Systems, Man, and Cybernetics, 1994. {\textquoteright}Humans, Information and Technology{\textquoteright}},
	volume = {2},
	year = {1994},
	month = {1994/10/02/5},
	pages = {1645-1650 vol.2 - 1645-1650 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An emerging requirement to sift through the increasing flood of text information has led to the rapid development of information filtering technology in the past five years. This study introduces novel approaches for filtering texts regardless of their source language. We begin with a brief description of related developments in text filtering and multilingual information retrieval. We then present three alternative approaches to selecting texts from a multilingual information stream which represent a logical evolution from existing techniques in related disciplines. Finally, a practical automated performance evaluation technique is proposed},
	keywords = {automated performance evaluation, Business communication, Computer science, Discussion forums, Displays, Educational institutions, Floods, Government, Information filtering, Information filters, Information retrieval, multilingual information retrieval, multilingual text filtering, natural languages, performance evaluation},
	isbn = {0-7803-2129-4},
	doi = {10.1109/ICSMC.1994.400083},
	author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C.}
}
@article {16740,
	title = {ADMS: a testbed for incremental access methods},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {5},
	year = {1993},
	month = {1993/10//},
	pages = {762 - 774},
	abstract = {ADMS is an advanced database management system developed-to experiment with incremental access methods for large and distributed databases. It has been developed over the past eight years at the University of Maryland. The paper provides an overview of ADMS, and describes its capabilities and the performance attained by its incremental access methods. This paper also describes an enhanced client-server architecture that allows an incremental gateway access to multiple heterogeneous commercial database management systems},
	keywords = {Add-drop multiplexers, ADMS, advanced database management system, client-server architecture, commercial database management systems, Computational modeling, Database systems, distributed databases, heterogeneous DBMS, incremental access methods, incremental gateway, Information retrieval, interoperability, join index, large databases, Navigation, network operating systems, Object oriented databases, Object oriented modeling, Query processing, System testing, very large databases, view index, Workstations},
	isbn = {1041-4347},
	doi = {10.1109/69.243508},
	author = {Roussopoulos, Nick and Economou,N. and Stamenas,A.}
}
@article {16764,
	title = {Incremental implementation model for relational databases with transaction time},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {461 - 473},
	abstract = {An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved},
	keywords = {Computational modeling, Computer science, Data models, data retrieval, Database languages, Database systems, database theory, decremental computations, deferred update, Degradation, differential computation, historical data, History, incremental computations, Information retrieval, partitioned storage models, queries, relational data model, Relational databases, stored views, Transaction databases, transaction time, view materialization},
	isbn = {1041-4347},
	doi = {10.1109/69.109107},
	author = {Jensen,C. S and Mark,L. and Roussopoulos, Nick}
}
@article {17164,
	title = {Finding facts vs. browsing knowledge in hypertext systems},
	journal = {Computer},
	volume = {21},
	year = {1988},
	month = {1988/01//},
	pages = {70 - 80},
	abstract = {The authors discuss the role of information retrieval, interface design, and cognitive science in hypertext research. They present a user-centered framework for information-seeking that has been used in evaluating two hypertext systems. They apply the framework to key design issues related to information retrieval in hypertext systems.<>},
	keywords = {browsing knowledge, Cognitive science, cognitive systems, Electronic publishing, hypertext research, hypertext systems, Information retrieval, information retrieval systems, information-seeking, interface design, User interfaces, word processing},
	isbn = {0018-9162},
	doi = {10.1109/2.222119},
	author = {Marchionini,G. and Shneiderman, Ben}
}
@article {16737,
	title = {The Logical Access Path Schema of a Database},
	journal = {IEEE Transactions on Software Engineering},
	volume = {SE-8},
	year = {1982},
	month = {1982/11//},
	pages = {563 - 573},
	abstract = {A new schema which models the usage of the logical access paths of the database is proposed. The schema models all database activities (i.e., retrievals and updates), and integrates their logical access paths by recognizing common subpaths and increasing the "weight" of the shared subpaths. The logical access path schema provides a comprehensive picture of the logical access paths, and the cumulative usage of the shared subpaths and/or intermediate results. The schema serves a dual purpose. Firstly, it is used as a model of the access requirements during the database design, and secondly, as the basis for optimization during the operation of the database.},
	keywords = {Aggregation hierarchy, Calculus, Computer science, Data structures, Databases, Design optimization, external logical subschema, generalization hierarchy, Information retrieval, Joining processes, logical access path, propositional calculus, views},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1982.235886},
	author = {Roussopoulos, Nick}
}
@article {17311,
	title = {Optimum data base reorganization points},
	journal = {Communications of the ACM},
	volume = {16},
	year = {1973},
	month = {1973/06//},
	pages = {362 - 365},
	abstract = {In certain data base organization schemes the cost per access may increase due to structural inefficiencies caused by update. By reorganizing the data base the cost per access may be reduced. However, the high cost of a reorganization prohibits frequent reorganizations. This paper examines strategies for selecting the optimum reorganization points.},
	keywords = {data base, files, Information retrieval, reorganization},
	isbn = {0001-0782},
	doi = {10.1145/362248.362267},
	url = {http://doi.acm.org/10.1145/362248.362267},
	author = {Shneiderman, Ben}
}
