Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

Categorical Range Reporting with Frequencies

In this paper, we consider a variant of the color range reporting problem called color reporting with frequencies. Our goal is to pre-process a set of colored points into a data structure, so that given a query range Q, we can report all colors that appear in Q, along with their respective frequencies. In other words, for each reported color, we also output the number of times it occurs in Q. We describe an external-memory data structure that uses O(N(1+log^2D/log N)) words and answers one-dimensional queries in O(1 +K/B) I/Os, where N is the total number of points in the data structure, D is the total number of colors in the data structure, K is the number of reported colors, and B is the block size. Next we turn to an approximate version of this problem: report all colors sigma that appear in the query range; for every reported color, we provide a constant-factor approximation on its frequency. We consider color reporting with approximate frequencies in two dimensions. Our data structure uses O(N) space and answers two-dimensional queries in O(log_B N +log^*B + K/B) I/Os in the special case when the query range is bounded on two sides. As a corollary, we can also answer one-dimensional approximate queries within the same time and space bounds

Recurrence Plot Based Measures of Complexity and its Application to Heart Rate Variability Data

The knowledge of transitions between regular, laminar or chaotic behavior is essential to understand the underlying mechanisms behind complex systems. While several linear approaches are often insufficient to describe such processes, there are several nonlinear methods which however require rather long time observations. To overcome these difficulties, we propose measures of complexity based on vertical structures in recurrence plots and apply them to the logistic map as well as to heart rate variability data. For the logistic map these measures enable us not only to detect transitions between chaotic and periodic states, but also to identify laminar states, i.e. chaos-chaos transitions. The traditional recurrence quantification analysis fails to detect the latter transitions. Applying our new measures to the heart rate variability data, we are able to detect and quantify the laminar phases before a life-threatening cardiac arrhythmia occurs thereby facilitating a prediction of such an event. Our findings could be of importance for the therapy of malignant cardiac arrhythmias

StarGO: A New Method to Identify the Galactic Origins of Halo Stars

We develop a new method StarGO (Stars' Galactic Origin) to identify the galactic origins of halo stars using their kinematics. Our method is based on self-organizing map (SOM), which is one of the most popular unsupervised learning algorithms. StarGO combines SOM with a novel adaptive group identification algorithm with essentially no free parameters. In order to evaluate our model, we build a synthetic stellar halo from mergers of nine satellites in the Milky Way. We construct the mock catalogue by extracting a heliocentric volume of 10 kpc from our simulations and assigning expected observational uncertainties corresponding to bright stars from Gaia DR2 and LAMOST DR5. We compare the results from StarGO against that from a Friends-of-Friends (FoF) based method in the space of orbital energy and angular momentum. We show that StarGO is able to systematically identify more satellites and achieve higher number fraction of identified stars for most of the satellites within the extracted volume. When applied to data from Gaia DR2, StarGO will enable us to reveal the origins of the inner stellar halo in unprecedented detail.Comment: 11 pages, 7 figures, Accepted for publication in Ap

Binary Quasars in the Sloan Digital Sky Survey: Evidence for Excess Clustering on Small Scales

We present a sample of 218 new quasar pairs with proper transverse separations R_prop < 1 Mpc/h over the redshift range 0.5 < z < 3.0, discovered from an extensive follow up campaign to find companions around the Sloan Digital Sky Survey and 2dF Quasar Redshift Survey quasars. This sample includes 26 new binary quasars with separations R_prop < 50 kpc/h (theta < 10 arcseconds), more than doubling the number of such systems known. We define a statistical sample of binaries selected with homogeneous criteria and compute its selection function, taking into account sources of incompleteness. The first measurement of the quasar correlation function on scales 10 kpc/h < R_prop < 400 kpc/h is presented. For R_prop < 40 kpc/h, we detect an order of magnitude excess clustering over the expectation from the large scale R_prop > 3 Mpc/h quasar correlation function, extrapolated down as a power law to the separations probed by our binaries. The excess grows to ~ 30 at R_prop ~ 10 kpc/h, and provides compelling evidence that the quasar autocorrelation function gets progressively steeper on sub-Mpc scales. This small scale excess can likely be attributed to dissipative interaction events which trigger quasar activity in rich environments. Recent small scale measurements of galaxy clustering and quasar-galaxy clustering are reviewed and discussed in relation to our measurement of small scale quasar clustering.Comment: 25 pages, 12 figures, 9 tables. Submitted to the Astronomical Journa

Visual analysis of document triage data

As part of the information seeking process, a large amount of effort is invested in order to study and understand how information seekers search through documents such that they can assess their relevance. This search and assessment of document relevance, known as document triage, is an important information seeking process, but is not yet well understood. Human-computer interaction (HCI) and digital library scientists have undertaken a series of user studies involving information seeking, collected a large amount of data describing information seekers' behavior during document search. Next to this, we have witnessed a rapid increase in the number of off-the-shelf visualization tools which can benefit document triage study. Here we set out to utilize existing information visualization techniques and tools in order to gain a better understanding of the large amount of user-study data collected by HCI and digital library researchers. We describe the range of available tools and visualizations we use in order to increase our knowledge of document triage. Treemap, parallel coordinates, stack graph, matrix chart, as well as other visualization methods, prove to be insightful in exploring, analyzing and presenting user behavior during document triage. Our findings and visualizations are evaluated by HCI and digital library researchers studying this proble

Evaluating Cartogram Effectiveness

Cartograms are maps in which areas of geographic regions (countries, states) appear in proportion to some variable of interest (population, income). Cartograms are popular visualizations for geo-referenced data that have been used for over a century and that make it possible to gain insight into patterns and trends in the world around us. Despite the popularity of cartograms and the large number of cartogram types, there are few studies evaluating the effectiveness of cartograms in conveying information. Based on a recent task taxonomy for cartograms, we evaluate four major different types of cartograms: contiguous, non-contiguous, rectangular, and Dorling cartograms. Specifically, we evaluate the effectiveness of these cartograms by quantitative performance analysis, as well as by subjective preferences. We analyze the results of our study in the context of some prevailing assumptions in the literature of cartography and cognitive science. Finally, we make recommendations for the use of different types of cartograms for different tasks and settings

Searching the Visual Style and Structure of D3 Visualizations

We present a search engine for D3 visualizations that allows queries based on their visual style and underlying structure. To build the engine we crawl a collection of 7860 D3 visualizations from the Web and deconstruct each one to recover its data, its data-encoding marks and the encodings describing how the data is mapped to visual attributes of the marks. We also extract axes and other non-data-encoding attributes of marks (e.g., typeface, background color). Our search engine indexes this style and structure information as well as metadata about the webpage containing the chart. We show how visualization developers can search the collection to find visualizations that exhibit specific design characteristics and thereby explore the space of possible designs. We also demonstrate how researchers can use the search engine to identify commonly used visual design patterns and we perform such a demographic design analysis across our collection of D3 charts. A user study reveals that visualization developers found our style and structure based search engine to be significantly more useful and satisfying for finding different designs of D3 charts, than a baseline search engine that only allows keyword search over the webpage containing a chart