@article {14415,
	title = {Organizing User Search Histories},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {24},
	year = {2012},
	month = {2012/05//},
	pages = {912 - 925},
	abstract = {Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user{\textquoteright}s historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a number of different search engine components and applications, such as query suggestions, result ranking, query alterations, sessionization, and collaborative search. In our approach, we go beyond approaches that rely on textual similarity or time thresholds, and we propose a more robust approach that leverages search query logs. We experimentally study the performance of different techniques, and showcase their potential, especially when combined together.},
	keywords = {alteration;query, analysis;user, engines;search, engines;text, goal;textual, group, historical, History, identification;query, information, interfaces;, log;sessionization;task-oriented, organization;query, processing;search, query, query;user, quest;query, ranking;search, search, search;long-term, similarity;time, suggestion;result, threshold;user, Web;collaborative},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2010.251},
	author = {Hwang,Heasoo and Lauw,H. W and Getoor, Lise and Ntoulas,A.}
}
@conference {12986,
	title = {Computing the Tree of Life: Leveraging the Power of Desktop and Service Grids},
	booktitle = {Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on},
	year = {2011},
	month = {2011/05//},
	pages = {1896 - 1902},
	abstract = {The trend in life sciences research, particularly in molecular evolutionary systematics, is toward larger data sets and ever-more detailed evolutionary models, which can generate substantial computational loads. Over the past several years we have developed a grid computing system aimed at providing researchers the computational power needed to complete such analyses in a timely manner. Our grid system, known as The Lattice Project, was the first to combine two models of grid computing - the service model, which mainly federates large institutional HPC resources, and the desktop model, which harnesses the power of PCs volunteered by the general public. Recently we have developed a "science portal" style web interface that makes it easier than ever for phylogenetic analyses to be completed using GARLI, a popular program that uses a maximum likelihood method to infer the evolutionary history of organisms on the basis of genetic sequence data. This paper describes our approach to scheduling thousands of GARLI jobs with diverse requirements to heterogeneous grid resources, which include volunteer computers running BOINC software. A key component of this system provides a priori GARLI runtime estimates using machine learning with random forests.},
	keywords = {(artificial, (mathematics);user, analysis;science, BOINC, computation;grid, computational, computing, computing;information, computing;machine, data;grid, estimation;portals;trees, evolutionary, Grid, grids;service, handling;evolutionary, history;evolutionary, intelligence);maximum, interface;computational, interfaces;, jobs;HPC, learning;maximum, likelihood, load;Internet;data, method;molecular, model;genetic, model;substantial, portal;service, power;data, project;life, resource;lattice, resource;Web, sequence, services;learning, sets;evolutionary, software;GARLI, system;heterogeneous, systematics;phylogenetic, tree},
	doi = {10.1109/IPDPS.2011.344},
	author = {Bazinet,A. L and Cummings, Michael P.}
}
@conference {16058,
	title = {VAST 2009 challenge: An insider threat},
	booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on},
	year = {2009},
	month = {2009/10//},
	pages = {243 - 244},
	abstract = {The 4th VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.},
	keywords = {2009, analytics;data, analytics;geospatial, challenge;cyber, data;security, information, information;human, interaction;network, interfaces;, network;visual, traffic, user, VAST, video;social, visualisation;graphical},
	doi = {10.1109/VAST.2009.5334454},
	author = {Grinstein,G. and Scholtz,J. and Whiting,M. and Plaisant, Catherine}
}
@conference {14404,
	title = {GeoDDupe: A Novel Interface for Interactive Entity Resolution in Geospatial Data},
	booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference},
	year = {2007},
	month = {2007/07//},
	pages = {489 - 496},
	abstract = {Due to the growing interest in geospatial data mining and analysis, data cleaning and integration in geospatial data is becoming an important issue. Geospatial entity resolution is the process of reconciling multiple location references to the same real world location within a single data source (deduplication) or across multiple data sources (integration). In this paper, we introduce an interactive tool called GeoDDupe which effectively combines automatic data mining algorithms for geospatial entity resolution with a novel network visualization supporting users{\textquoteright} resolution analysis and decisions. We illustrate the GeoDDupe interface with an example geospatial dataset and show how users can efficiently and accurately resolve location entities. Finally, the case study with two real-world geospatial datasets demonstrates the potential of GeoDDupe.},
	keywords = {algorithms;data, cleaning;geospatial, data, entity, GeoDDupe;automatic, interfaces;, mining, mining;geography;user, mining;geospatial, resolution;interactive, tool;network, visualization;data},
	doi = {10.1109/IV.2007.55},
	author = {Kang,Hyunmo and Sehgal,V. and Getoor, Lise}
}
@conference {16074,
	title = {VAST 2007 Contest - Blue Iguanodon},
	booktitle = {Visual Analytics Science and Technology, 2007. VAST 2007. IEEE Symposium on},
	year = {2007},
	month = {2007/11/30/1},
	pages = {231 - 232},
	abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The second visual analytics science and technology (VAST) contest was held in conjunction with the 2007 IEEE VAST symposium. In this contest participants were to use visual analytic tools to explore a large heterogeneous data collection to construct a scenario and find evidence buried in the data of illegal and terrorist activities that were occurring. A synthetic data set was made available as well as tasks. In this paper we describe some of the advances we have made from the first competition held in 2006.},
	keywords = {activities;large, activities;visual, analytic, collection;terrorist, data, heterogeneous, illegal, interfaces;, tools;data, user, visualisation;graphical},
	doi = {10.1109/VAST.2007.4389032},
	author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.}
}
@conference {14498,
	title = {D-Dupe: An Interactive Tool for Entity Resolution in Social Networks},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/2},
	pages = {43 - 50},
	abstract = {Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe{\textquoteright}s unique combination of entity resolution algorithms within a task-specific visual interface},
	keywords = {algorithm;data, analysis;social, computing;user, D-Dupe, interactive, interface;data, interfaces;, mining, mining;interactive, network, problem;entity, QUALITY, resolution;entity-resolution;social, sciences, systems;social, tool;data, visual, visualization;task-specific},
	doi = {10.1109/VAST.2006.261429},
	author = {Bilgic,M. and Licamele,L. and Getoor, Lise and Shneiderman, Ben}
}
@conference {12704,
	title = {Fusion of gait and face for human identification},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/05//},
	pages = {V - 901-4 vol.5 - V - 901-4 vol.5},
	abstract = {Identification of humans from arbitrary view points is an important requirement for different tasks including perceptual interfaces for intelligent environments, covert security and access control etc. For optimal performance, the system must use as many cues as possible and combine them in meaningful ways. In this paper, we discuss fusion of face and gait cues for the single camera case. We present a view invariant gait recognition algorithm for gait recognition. We employ decision fusion to combine the results of our gait recognition algorithm and a face recognition algorithm based on sequential importance sampling. We consider two fusion scenarios: hierarchical and holistic. The first involves using the gait recognition algorithm as a filter to pass on a smaller set of candidates to the face recognition algorithm. The second involves combining the similarity scores obtained individually from the face and gait recognition algorithms. Simple rules like the SUM, MIN and PRODUCT are used for combining the scores. The results of fusion experiments are demonstrated on the NIST database which has outdoor gait and face data of 30 subjects.},
	keywords = {access, algorithm;, analysis;, combining, control;, covert, cues;, data, decision, Environment, Face, fusion;, Gait, hierarchical, holistic, human, identification;, importance, intelligent, interfaces;, invariant, perceptual, recognition, recognition;, rules;, sampling;, score, scores;, security;, sensor, sequential, similarity, view},
	doi = {10.1109/ICASSP.2004.1327257},
	author = {Kale, A. and Roy Chowdhury, A.K. and Chellapa, Rama}
}
@article {13215,
	title = {Rendering localized spatial audio in a virtual auditory space},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/08//},
	pages = {553 - 564},
	abstract = {High-quality virtual audio scene rendering is required for emerging virtual and augmented reality applications, perceptual user interfaces, and sonification of data. We describe algorithms for creation of virtual auditory spaces by rendering cues that arise from anatomical scattering, environmental scattering, and dynamical effects. We use a novel way of personalizing the head related transfer functions (HRTFs) from a database, based on anatomical measurements. Details of algorithms for HRTF interpolation, room impulse response creation, HRTF selection from a database, and audio scene presentation are presented. Our system runs in real time on an office PC without specialized DSP hardware.},
	keywords = {(computer, 3-D, audio, audio;, auditory, augmented, data, environments;, functions;, graphics);, Head, interfaces;, perceptual, processing;, reality, reality;, related, rendering, rendering;, scene, signal, sonification;, spaces;, spatial, transfer, user, virtual},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.827516},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@article {12165,
	title = {User interface evaluation and empirically-based evolution of a prototype experience management tool},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {29},
	year = {2003},
	month = {2003/09//},
	pages = {838 - 850},
	abstract = {Experience management refers to the capture, structuring, analysis, synthesis, and reuse of an organization{\textquoteright}s experience in the form of documents, plans, templates, processes, data, etc. The problem of managing experience effectively is not unique to software development, but the field of software engineering has had a high-level approach to this problem for some time. The Experience Factory is an organizational infrastructure whose goal is to produce, store, and reuse experiences gained in a software development organization. This paper describes The Q-Labs Experience Management System (Q-Labs EMS), which is based on the Experience Factory concept and was developed for use in a multinational software engineering consultancy. A critical aspect of the Q-Labs EMS project is its emphasis on empirical evaluation as a major driver of its development and evolution. The initial prototype requirements were grounded in the organizational needs and vision of Q-Labs, as were the goals and evaluation criteria later used to evaluate the prototype. However, the Q-Labs EMS architecture, data model, and user interface were designed to evolve, based on evolving user needs. This paper describes this approach, including the evaluation that was conducted of the initial prototype and its implications for the further development of systems to support software experience management.},
	keywords = {data, development;, empirical, EMS;, engineering;, evaluation;, experience, experience;, Factory;, interface, interfaces;, knowledge, management, management;, model;, models;, organization, performance, prototype, Q-Labs, re-engineering;, reusability;, reuse;, software, system;, systems, tool;, user},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2003.1232288},
	author = {Seaman,C.B and Mendonca,M.G. and Basili, Victor R. and Kim,Y. M}
}
@conference {18156,
	title = {A recognition algorithm for Chinese characters in diverse fonts},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {3},
	year = {2002},
	month = {2002/06//},
	pages = {981 - 984 vol.3 - 981 - 984 vol.3},
	abstract = {The paper proposes an algorithm for recognizing Chinese characters in many diverse fonts including Song, Fang, Kai, Hei, Yuan, Lishu, Weibei and Xingkai. The algorithm is based on features derived from peripheral direction contributions and utilizes a set of dictionaries. A 3-level matching is first performed with respect to each dictionary. The distance measures associated with these matches are then fed into a central discriminator to output the final recognition result. We propose a new multi-dictionary matching algorithm for use in the central discriminator that utilizes estimated information of neighborhood fonts. Experiments have been performed on a practical OCR software system whose recognition kernel is based on the proposed algorithm. Fast and accurate recognition has been accomplished both in title recognition, involving all of the 8 fonts, and in main-body recognition, that usually involves only the first 4 most commonly used fonts.},
	keywords = {algorithm;, central, character, Chinese, contributions;, direction, discriminator;, diverse, fonts;, image, interfaces;, LANGUAGE, MATCHING, matching;, multi-dictionary, natural, OCR, optical, peripheral, recognition, recognition;, sets;, software, system;},
	doi = {10.1109/ICIP.2002.1039139},
	author = {Wu,Xianli and M. Wu}
}
@conference {16150,
	title = {SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {57 - 64},
	abstract = {We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.},
	keywords = {browser;, camera, data, design, diagrams;, dynamic, evolution;, experiment;, exploration;, filter, functions;, graphical, icons;, integrated, interfaces;, large, link, movement;, node, novel, optimized, rescaling;, search;, SpaceTree;, structures;, topology;, tree, user, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173148},
	author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.}
}
@conference {17928,
	title = {FINESSE: a financial information spreadsheet},
	booktitle = {Information Visualization {\textquoteright}96, Proceedings IEEE Symposium on},
	year = {1996},
	month = {1996/10//},
	pages = {70 -71, 125 - 70 -71, 125},
	abstract = {We outline a spreadsheet-based system for visualization of real-time financial information. Our system permits the user to define arithmetic and presentation relationships amongst the various cells of the spreadsheet. The cells contain primitives that can be numbers, text, images, functions and graphics. Presenting financial information in this format allows its intended clients, the financial analysts, to work in the familiar environment of a spreadsheet and allows them the flexibility afforded by the powerful interface of the spreadsheet paradigm. In addition, our system permits real-time visualization of the financial data stream allowing its user to visually trade the changing market trends in two and three dimensions},
	keywords = {cells;text;three, data, dimensions;two, dimensions;user, financial, FINESSE;arithmetic;data, information, information;spreadsheet, interface;data, interfaces;, presentation;market, processing;real-time, programs;user, spreadsheet;functions;graphics;images;information, systems;spreadsheet, trends;numbers;presentation;real-time, visualisation;financial, visualization;financial},
	doi = {10.1109/INFVIS.1996.559222},
	author = {Varshney, Amitabh and Kaufman,A.}
}
@conference {16201,
	title = {Query previews in networked information systems},
	booktitle = {Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96., Proceedings of the Third Forum on},
	year = {1996},
	month = {1996/05//},
	pages = {120 - 129},
	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 = {attribute, complexity;data, data, Earth, environment;networked, EOS-DIS;NASA, formulation;querying, formulation;user, hit, information, interfaces;, interfaces;exploratory, method;matching, networks;information, Observing, patterns;data, performance;networked, Preview;Query, process;rough, queries;computer, query, refinement;data, retrieval;information, services;interactive, sets;network, System-Data, System;Query, systems;query, user, values;zero, volume;dynamic},
	doi = {10.1109/ADL.1996.502522},
	author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben}
}
