@inbook {19628,
	title = {A Canonical Form for Testing Boolean Function Properties},
	booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
	series = {Lecture Notes in Computer Science},
	year = {2011},
	month = {2011/01/01/},
	pages = {460 - 471},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a {\textquotedblleft}canonical{\textquotedblright} tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every {\textquotedblleft}nice{\textquotedblright} family of Boolean functions that has low noise sensitivity and is testable by an {\textquotedblleft}independent tester,{\textquotedblright} has a canonical testing algorithm. Our second main result is similar but holds instead for families of Boolean functions that are closed under ID-negative minors. Taken together, these two results cover almost all of the constant-query Boolean function testing algorithms that we know of in the literature, and show that all of these testing algorithms can be automatically converted into a canonical form.},
	keywords = {Algorithm Analysis and Problem Complexity, Boolean functions, Computation by Abstract Devices, Computer Communication Networks, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, property testing},
	isbn = {978-3-642-22934-3, 978-3-642-22935-0},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-22935-0_39},
	author = {Dana Dachman-Soled and Servedio, Rocco A.},
	editor = {Goldberg, Leslie Ann and Jansen, Klaus and Ravi, R. and Rolim, Jos{\'e} D. P.}
}
@article {17180,
	title = {Graph Analytics-Lessons Learned and Challenges Ahead},
	volume = {31},
	year = {2011},
	month = {2011///},
	pages = {18 - 29},
	abstract = {Graph analytics is one of the most influential and important R\&D topics in the visual analytics community. Researchers with diverse backgrounds from information visualization, human-computer interaction, computer graphics, graph drawing, and data mining have pursued graph analytics from scientific, technical, and social approaches. These studies have addressed both distinct and common challenges. Past successes and mistakes can provide valuable lessons for revising the research agenda. In this article, six researchers from four academic and research institutes identify graph analytics{\textquoteright} fundamental challenges and present both insightful lessons learned from their experience and good practices in graph analytics research. The goal is to critically assess those lessons and shed light on how they can stimulate research and draw attention to grand challenges for graph analytics. The article also establishes principles that could lead to measurable standards and criteria for research.},
	keywords = {citation analysis, citespace, Computer Graphics, document analysis, graphics and multimedia, greengrid, jigsaw system, modeling, power grid analysis, semantic substrates, simulation, social networks, text analysis, Visualization},
	isbn = {0272-1716},
	author = {Wong,Pak Chung and Chen,Chaomei and Gorg,Carsten and Shneiderman, Ben and Stasko,John and Thomas,Jim}
}
@inbook {19605,
	title = {Graph Drawing for Security Visualization},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2009},
	month = {2009/01/01/},
	pages = {2 - 13},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {With the number of devices connected to the internet growing rapidly and software systems being increasingly deployed on the web, security and privacy have become crucial properties for networks and applications. Due the complexity and subtlety of cryptographic methods and protocols, software architects and developers often fail to incorporate security principles in their designs and implementations. Also, most users have minimal understanding of security threats. While several tools for developers, system administrators and security analysts are available, these tools typically provide information in the form of textual logs or tables, which are cumbersome to analyze. Thus, in recent years, the field of security visualization has emerged to provide novel ways to display security-related information so that it is easier to understand. In this work, we give a preliminary survey of approaches to the visualization of computer security concepts that use graph drawing techniques.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-642-00218-2, 978-3-642-00219-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-00219-9_2},
	author = {Tamassia, Roberto and Palazzi, Bernardo and Charalampos Papamanthou},
	editor = {Tollis, Ioannis G. and Patrignani, Maurizio}
}
@article {17397,
	title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {15},
	year = {2009},
	month = {2009/12//Nov},
	pages = {1049 - 1056},
	abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.},
	keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2009.187},
	author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.}
}
@article {17250,
	title = {Interactive Entity Resolution in Relational Data: A Visual Analytic Tool and Its Evaluation},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {14},
	year = {2008},
	month = {2008/10//Sept},
	pages = {999 - 1014},
	abstract = {Databases often contain uncertain and imprecise references to real-world entities. Entity resolution, the process of reconciling multiple references to underlying real-world entities, is an important data cleaning process required before accurate visualization or analysis of the data is possible. In many cases, in addition to noisy data describing entities, there is data describing the relationships among the entities. This relational data is important during the entity resolution process; it is useful both for the algorithms which determine likely database references to be resolved and for visual analytic tools which support the entity resolution process. In this paper, we introduce a novel user interface, D-Dupe, for interactive entity resolution in relational data. D-Dupe effectively combines relational entity resolution algorithms with a novel network visualization that enables users to make use of an entity{\textquoteright}s relational context for making resolution decisions. Since resolution decisions often are interdependent, D-Dupe facilitates understanding this complex process through animations which highlight combined inferences and a history mechanism which allows users to inspect chains of resolution decisions. An empirical study with 12 users confirmed the benefits of the relational context visualization on the performance of entity resolution tasks in relational data in terms of time as well as users{\textquoteright} confidence and satisfaction.},
	keywords = {algorithms, Computer Graphics, D-Dupe, data visualisation, database management systems, Databases, Factual, graphical user interface, Graphical user interfaces, human-centered computing, Image Interpretation, Computer-Assisted, Information Storage and Retrieval, Information Visualization, interactive entity resolution, relational context visualization, Relational databases, relational entity resolution algorithm, User interfaces, user-centered design, User-Computer Interface, visual analytic tool},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2008.55},
	author = {Kang,Hyunmo and Getoor, Lise and Shneiderman, Ben and Bilgic,M. and Licamele,L.}
}
@book {13327,
	title = {Shape Analysis and Structuring},
	year = {2008},
	month = {2008///},
	publisher = {Springer},
	organization = {Springer},
	abstract = {With a lot of recent developments in the field, this much-needed book has come at just the right time. It covers a variety of topics related to preserving and enhancing shape information at a geometric level. The contributors also cover subjects that are relevant to effectively capturing the structure of a shape by identifying relevant shape components and their mutual relationships.},
	keywords = {Computer Graphics, Computer vision, Computers / Computer Graphics, Computers / Image Processing, Geometrical models, Geometry, Geometry, Analytic, Image analysis, IMAGE PROCESSING, Mathematics / Functional Analysis, Mathematics / Geometry / General, Mathematics / Graphic Methods, Mathematics / Mathematical Analysis, shapes, Technology \& Engineering / Engineering (General), Visualization},
	isbn = {9783540332640},
	author = {De Floriani, Leila and Spagnuolo,Michela}
}
@inbook {19606,
	title = {On the Cost of Persistence and Authentication in Skip Lists},
	booktitle = {Experimental Algorithms},
	series = {Lecture Notes in Computer Science},
	year = {2007},
	month = {2007/01/01/},
	pages = {94 - 107},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.},
	keywords = {Algorithm Analysis and Problem Complexity, algorithms, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, Numeric Computing},
	isbn = {978-3-540-72844-3, 978-3-540-72845-0},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-72845-0_8},
	author = {Goodrich, Michael T. and Charalampos Papamanthou and Tamassia, Roberto},
	editor = {Demetrescu, Camil}
}
@inbook {19623,
	title = {Parameterized st-Orientations of Graphs: Algorithms and Experiments},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2007},
	month = {2007/01/01/},
	pages = {220 - 233},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. However, as indicated in [1], the computation of more than one st-orientation is very important for many applications in multiple research areas, such as this of Graph Drawing. In this paper we show how to compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. Apart from Graph Drawing, this work applies in other areas such as Network Routing and in tackling difficult problems such as Graph Coloring and Longest Path. We present primary approaches to the problem of computing longest path parameterized st-orientations of graphs, an analytical presentation (together with proof of correctness) of a new O(mlog5 n) (O(mlogn) for planar graphs) time algorithm that computes such orientations (and which was used in [1]) and extensive computational results that reveal the robustness of the algorithm.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-70903-9, 978-3-540-70904-6},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-70904-6_22},
	author = {Charalampos Papamanthou and Tollis, Ioannis G.},
	editor = {Kaufmann, Michael and Wagner, Dorothea}
}
@inbook {19624,
	title = {Applications of Parameterized st-Orientations in Graph Drawing Algorithms},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2006},
	month = {2006/01/01/},
	pages = {355 - 367},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-31425-7, 978-3-540-31667-1},
	url = {http://link.springer.com/chapter/10.1007/11618058_32},
	author = {Charalampos Papamanthou and Tollis, Ioannis G.},
	editor = {Healy, Patrick and Nikolov, Nikola S.}
}
@article {16983,
	title = {Balancing Systematic and Flexible Exploration of Social Networks},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {12},
	year = {2006},
	month = {2006/10//Sept},
	pages = {693 - 700},
	abstract = {Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks},
	keywords = {Aggregates, algorithms, attribute ranking, Cluster Analysis, Computer Graphics, Computer simulation, Coordinate measuring machines, coordinated views, Data analysis, data visualisation, Data visualization, exploratory data analysis, Filters, Gain measurement, graph theory, Graphical user interfaces, Information Storage and Retrieval, interactive graph visualization, matrix algebra, matrix overview, Models, Biological, Navigation, network visualization, Pattern analysis, Population Dynamics, Social Behavior, social network analysis, Social network services, social networks, social sciences computing, Social Support, SocialAction, software, statistical analysis, statistical methods, User-Computer Interface},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2006.122},
	author = {Perer,A. and Shneiderman, Ben}
}
@inbook {19610,
	title = {3D Visualization of Semantic Metadata Models and Ontologies},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2005},
	month = {2005/01/01/},
	pages = {377 - 388},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We propose an algorithm for the 3D visualization of general ontology models used in many applications, such as semantic web, entity-relationship diagrams and other database models. The visualization places entities in the 3D space. Previous techniques produce drawings that are 2-dimensional, which are often complicated and hard to comprehend. Our technique uses the third dimension almost exclusively for the display of the isa relationships (links) while the property relationships (links) are placed on some layer (plane). Thus the semantic difference between isa links and property links, which should be as vertical or as horizontal as possible respectively, is emphasized. Special reference is made on a certain model, the CIDOC Conceptual Reference Model.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-24528-5, 978-3-540-31843-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-31843-9_38},
	author = {Charalampos Papamanthou and Tollis, Ioannis G. and Doerr, Martin},
	editor = {Pach, J{\'a}nos}
}
@conference {17359,
	title = {Show Me! Guidelines for producing recorded demonstrations},
	booktitle = {2005 IEEE Symposium on Visual Languages and Human-Centric Computing},
	year = {2005},
	month = {2005/09/20/24},
	pages = {171 - 178},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of visually appealing and cognitively effective recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.},
	keywords = {animation, auditory cues, Computer aided instruction, Computer animation, Computer Graphics, Computer interfaces, computer literacy, content guidelines, documentation, Government, Graphical user interfaces, Guidelines, Laboratories, narration, recorded demonstrations, screen capture animation, technical guidelines, usability, User interfaces, visual appeal, visual cues},
	isbn = {0-7695-2443-5},
	doi = {10.1109/VLHCC.2005.57},
	author = {Plaisant, Catherine and Shneiderman, Ben}
}
@article {12698,
	title = {An information theoretic criterion for evaluating the quality of 3-D reconstructions from video},
	journal = {Image Processing, IEEE Transactions on},
	volume = {13},
	year = {2004},
	month = {2004/07//},
	pages = {960 - 973},
	abstract = {Even though numerous algorithms exist for estimating the three-dimensional (3-D) structure of a scene from its video, the solutions obtained are often of unacceptable quality. To overcome some of the deficiencies, many application systems rely on processing more data than necessary, thus raising the question: how is the accuracy of the solution related to the amount of data processed by the algorithm? Can we automatically recognize situations where the quality of the data is so bad that even a large number of additional observations will not yield the desired solution? Previous efforts to answer this question have used statistical measures like second order moments. They are useful if the estimate of the structure is unbiased and the higher order statistical effects are negligible, which is often not the case. This paper introduces an alternative information-theoretic criterion for evaluating the quality of a 3-D reconstruction. The accuracy of the reconstruction is judged by considering the change in mutual information (MI) (termed as the incremental MI) between a scene and its reconstructions. An example of 3-D reconstruction from a video sequence using optical flow equations and known noise distribution is considered and it is shown how the MI can be computed from first principles. We present simulations on both synthetic and real data to demonstrate the effectiveness of the proposed criterion.},
	keywords = {3D reconstruction, algorithms, Artificial intelligence, Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer Graphics, Computer-Assisted;Imaging, Computer-Assisted;Software Validation;Subtraction Technique;Video Recording;, Image Enhancement, Image Interpretation, Image reconstruction, Image sequences, information theoretic criterion, Mutual information, NOISE, noise distribution, optical flow equations, second order moments, statistical analysis, Three-Dimensional;Information Storage and Retrieval;Information Theory;Movement;Pattern Recognition, Video sequences, video signal processing},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2004.827240},
	author = {Roy-Chowdhury, A.K. and Chellapa, Rama}
}
@inbook {19651,
	title = {An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets},
	booktitle = {Computer Vision - ECCV 2004},
	series = {Lecture Notes in Computer Science},
	year = {2004},
	month = {2004/01/01/},
	pages = {279 - 290},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.},
	keywords = {Artificial Intelligence (incl. Robotics), Computer Graphics, Image Processing and Computer Vision, pattern recognition},
	isbn = {978-3-540-21981-1, 978-3-540-24673-2},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-24673-2_23},
	author = {Zia Khan and Balch, Tucker and Dellaert, Frank},
	editor = {Pajdla, Tom{\'a}s and Matas, Ji{\v r}{\'\i}}
}
@article {12682,
	title = {Visual tracking and recognition using appearance-adaptive models in particle filters},
	journal = {IEEE Transactions on Image Processing},
	volume = {13},
	year = {2004},
	month = {2004/11//},
	pages = {1491 - 1506},
	abstract = {We present an approach that incorporates appearance-adaptive models in a particle filter to realize robust visual tracking and recognition algorithms. Tracking needs modeling interframe motion and appearance changes, whereas recognition needs modeling appearance changes between frames and gallery images. In conventional tracking algorithms, the appearance model is either fixed or rapidly changing, and the motion model is simply a random walk with fixed noise variance. Also, the number of particles is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following modifications: an observation model arising from an adaptive appearance model, an adaptive velocity motion model with adaptive noise variance, and an adaptive number of particles. The adaptive-velocity model is derived using a first-order linear predictor based on the appearance difference between the incoming observation and the previous particle configuration. Occlusion analysis is implemented using robust statistics. Experimental results on tracking visual objects in long outdoor and indoor video sequences demonstrate the effectiveness and robustness of our tracking algorithm. We then perform simultaneous tracking and recognition by embedding them in a particle filter. For recognition purposes, we model the appearance changes between frames and gallery images by constructing the intra- and extrapersonal spaces. Accurate recognition is achieved when confronted by pose and view variations.},
	keywords = {adaptive filters, adaptive noise variance, algorithms, appearance-adaptive model, Artificial intelligence, Cluster Analysis, Computer Graphics, Computer simulation, Feedback, Filtering, first-order linear predictor, hidden feature removal, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, image recognition, Information Storage and Retrieval, Kinematics, Laboratories, Male, Models, Biological, Models, Statistical, MOTION, Movement, Noise robustness, Numerical Analysis, Computer-Assisted, occlusion analysis, Particle filters, Particle tracking, Pattern Recognition, Automated, Predictive models, Reproducibility of results, robust statistics, Sensitivity and Specificity, Signal Processing, Computer-Assisted, State estimation, statistical analysis, Subtraction Technique, tracking, Training data, visual recognition, visual tracking},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2004.836152},
	author = {Zhou,Shaohua Kevin and Chellapa, Rama and Moghaddam, B.}
}
@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.}
}
@article {17508,
	title = {Why not make interfaces better than 3D reality?},
	journal = {IEEE Computer Graphics and Applications},
	volume = {23},
	year = {2003},
	month = {2003/12//Nov},
	pages = {12 - 15},
	abstract = {Many constrained interfaces are designed to be simpler than the real world by restricting movement, limiting interface actions, and keeping interface objects in a plane. However, the strong utility of pure 3D interfaces for medical, architectural, product design, and scientific visualization means that interface design for pure 3D remains an important challenge. An intriguing possibility is that enhanced 3D interfaces might offer simpler navigation, more compelling functionality, safer movements, and less occlusion, than 3D reality, especially for information exploration and visualization tasks. Such features can enable superhuman capabilities such as faster-than-light teleportation, flying through objects, and X-ray vision. Enhanced 3D interfaces might have supernatural tools such as magic wands for instantly shrinking, enlarging, duplicating, or sending objects and enchanted environments that provide error prevention, history keeping, and programming-by-demonstration. Playful game designers and creative application developers have already pushed the technology further than those who seek merely to mimic reality. Advanced designs are marked by their support of rapid situation awareness through effective overviews, reduced numbers of actions to accomplish tasks; and prompt, meaningful feedback for user actions. This article reviews these clever enhanced 3D-design features and encourages approaches that facilitate user tasks rather than mimic reality.},
	keywords = {3D interfaces, 3D reality, Atmosphere, Avatars, Cities and towns, Collaboration, Computer displays, Computer Graphics, error prevention, history keeping, information exploration, Information Visualization, movements, Navigation, occlusion, overviews, programming-by-demonstration, rapid situation awareness, Testing, usability, user action feedback, User interfaces, Virtual reality, Visualization},
	isbn = {0272-1716},
	doi = {10.1109/MCG.2003.1242376},
	author = {Shneiderman, Ben}
}
@book {17339,
	title = {Readings in Information Visualization: Using Vision to Think},
	year = {1999},
	month = {1999/01/25/},
	publisher = {Morgan Kaufmann},
	organization = {Morgan Kaufmann},
	abstract = {This groundbreaking book defines the emerging field of information visualization and offers the first-ever collection of the classic papers of the discipline, with introductions and analytical discussions of each topic and paper. The authors{\textquoteright} intention is to present papers that focus on the use of visualization to discover relationships, using interactive graphics to amplify thought. This book is intended for research professionals in academia and industry; new graduate students and professors who want to begin work in this burgeoning field; professionals involved in financial data analysis, statistics, and information design; scientific data managers; and professionals involved in medical, bioinformatics, and other areas.* Full-color reproduction throughout* Author power team - an exciting and timely collaboration between the field{\textquoteright}s pioneering, most-respected names* The only book on Information Visualization with the depth necessary for use as a text or as a reference for the information professional* Text includes the classic source papers as well as a collection of cutting edge work},
	keywords = {Computer Graphics, Computers / Computer Engineering, Computers / Computer Graphics, Computers / Computer Graphics / General, Computers / Computer Science, Computers / General, Computers / Information Technology, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Computers / Social Aspects / Human-Computer Interaction, IMAGE PROCESSING, Information display systems, Information Visualization, Psychology / General, Visualization},
	isbn = {9781558605336},
	author = {Card,Stuart K. and Mackinlay,Jock D. and Shneiderman, Ben}
}
@book {13298,
	title = {Image Analysis and Processing: 8th International Conference, Iciap {\textquoteright}95, San Remo, Italy, September 13-15, 1995 : Proceedings},
	year = {1995},
	month = {1995/09/28/},
	publisher = {Springer},
	organization = {Springer},
	abstract = {This book presents the proceedings of the 8th International Conference on Image Analysis and Processing, ICIAP {\textquoteright}95, held in Sanremo, Italy in September 1995 under the sponsorship of the International Association of Pattern Recognition IAPR.The volume presents 108 papers selected from more than 180 submissions together with six invited contributions. The papers are written by a total of 265 contributing authors and give a comprehensive state-of-the-art report on all current issues of image analysis and processing. Theoretical aspects are addressed as well as systems design and advanced applications, particularly in medical imaging.},
	keywords = {Artificial intelligence, COMPUTER AIDED DESIGN, Computer Graphics, Computer science, Computer vision, Computers / CAD-CAM, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / Image Processing, Computers / Intelligence (AI) \& Semantics, Computers / Optical Data Processing, Computers / Software Development \& Engineering / General, Electronic books, IMAGE PROCESSING, Image processing/ Congresses, Imaging systems, Optical data processing, Optical pattern recognition, software engineering},
	isbn = {9783540602989},
	author = {Braccini,Carlo and De Floriani, Leila and Vernazza,Gianni}
}
@article {17222,
	title = {Image-browser taxonomy and guidelines for designers},
	journal = {IEEE Software},
	volume = {12},
	year = {1995},
	month = {1995/03//},
	pages = {21 - 32},
	abstract = {In many applications users must browse large images. Most designers merely use two one-dimensional scroll bars or ad hoc designs for two-dimensional scroll bars. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. Our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. We introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies. We focus on the tools to explore a selected image and so do not cover techniques to browse a series of images or to browse large-image databases},
	keywords = {analysis, Computer Graphics, design, designer guidelines, Equations, Europe, Evaluation, Formal specifications, Graphical user interfaces, Guidelines, IMAGE PROCESSING, image-browser taxonomy, informal specification technique, Laboratories, large image browsing, Layout, Road transportation, selected image exploration, SHAPE, Software design, task taxonomy, Taxonomy, tools, two-dimensional browsing, user interface management systems, visual databases},
	isbn = {0740-7459},
	doi = {10.1109/52.368260},
	author = {Plaisant, Catherine and Carr,D. and Shneiderman, Ben}
}
@conference {17438,
	title = {Tree-maps: a space-filling approach to the visualization of hierarchical information structures},
	booktitle = {, IEEE Conference on Visualization, 1991. Visualization {\textquoteright}91, Proceedings},
	year = {1991},
	month = {1991/10/22/25},
	pages = {284 - 291},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100\% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children},
	keywords = {Computer displays, Computer Graphics, Computer science, Data analysis, display space, Educational institutions, Feedback, hierarchical information structures, HUMANS, Laboratories, Libraries, Marine vehicles, rectangular region, semantic information, space-filling approach, tree-map visualization technique, trees (mathematics), Two dimensional displays, Visualization},
	isbn = {0-8186-2245-8},
	doi = {10.1109/VISUAL.1991.175815},
	author = {Johnson,B. and Shneiderman, Ben}
}
