{"title":"Efficient parallel extraction of crack-free isosurfaces from adaptive mesh refinement (AMR) data","authors":"G. Weber, H. Childs, J. Meredith","doi":"10.1109/LDAV.2012.6378973","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378973","url":null,"abstract":"We present a novel extraction scheme for crack-free isosurfaces from adaptive mesh refinement (AMR) data that builds on prior work utilizing dual grids and filling resulting gaps with stitch cells. We use a case-table-based approach to simplify the implementation of stitch cell generation. The most significant benefit of our new approach is that it uses ghost data to handle parallel isosurface extraction efficiently. We further present the results of applying this method to large scale data sets and analyze its computation time on parallel high-performance computing (HPC) platforms.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121304387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Redirecting research in large-format displays for visualization","authors":"K. Moreland","doi":"10.1109/LDAV.2012.6378981","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378981","url":null,"abstract":"Large-format displays, in particular tiled displays, remain actively used and researched today after almost two decades since their conception. Many government, academic, and commercial entities have invested considerably in the construction and use of large-format displays. During this time we have developed new applications but have also discovered faulty assumptions. This position paper evaluates the most important lessons learned from early and recent research in large-format displays. Each lesson suggests a direction for future research, which generally takes the form of a more user- and application-centric focus.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116364133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Salient time steps selection from large scale time-varying data sets with dynamic time warping","authors":"Xin Tong, Teng-Yok Lee, Han-Wei Shen","doi":"10.1109/LDAV.2012.6378975","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378975","url":null,"abstract":"Empowered by rapid advance of high performance computer architectures and software, it is now possible for scientists to perform high resolution simulations with unprecedented accuracy. Nowadays, the total size of data from a large-scale simulation can easily exceed hundreds of terabytes or even petabytes, distributed over a large number of time steps. The sheer size of data makes it difficult to perform post analysis and visualization after the computation is completed. Frequently, large amounts of valuable data produced from simulations are discarded, or left in disk unanalyzed. In this paper, we present a novel technique that can retrieve the most salient time steps, or key time steps, from large scale time-varying data sets. To achieve this goal, we develop a new time warping technique with an efficient dynamic programming scheme to map the whole sequence into an arbitrary number of time steps specified by the user. A novel contribution of our dynamic programming scheme is that the mapping between the whole time sequence and the key time steps is globally optimal, and hence the information loss is minimum. We propose a high performance algorithm to solve the dynamic programming problem that makes the selection of key times run in real time. Based on the technique, we create a visualization system that allows the user to browse time varying data at arbitrary levels of temporal detail. Because of the low computational complexity of this algorithm, the tool can help the user explore time varying data interactively and hierarchically. We demonstrate the utility of our algorithm by showing results from different time-varying data sets.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130071776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Atanas Z. Atanasov, Madhusudhanan Srinivasan, T. Weinzierl
{"title":"Query-driven parallel exploration of large datasets","authors":"Atanas Z. Atanasov, Madhusudhanan Srinivasan, T. Weinzierl","doi":"10.1109/LDAV.2012.6378972","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378972","url":null,"abstract":"Recent advances in supercomputing capabilities pose a multi-faceted data retrieval challenge to the exploration and visualisation of the obtained results: the bandwidth between visualisation devices and the high-performance computing (HPC) clusters neither scales with the simulation data nor with the compute power, the total memory footprint of the data on the supercomputer often exceeds the aggregate memory on the visualisation, and the data has to be distributed among several visualisation nodes working in parallel to render a visual. In the present paper, we introduce an on-demand data exploration paradigm that leverages HPC capabilities and distributed visualisation without requiring a large memory footprint on the visualisation cluster. Regions of interest within the data are specified by the user in the form of queries. These queries, augmented by node identifiers on the visualisation cluster, are automatically distributed among multiple compute nodes of the HPC cluster. The compute nodes work in parallel to assemble and merge data in response to the user query until the data distribution matches the visualisation cluster's topology. Query results are then simultaneously streamed to the right visualisation nodes. Our approach allows for interactive exploration of data residing on HPC resources, irrespective of memory footprint. The streaming of data to the visualisation nodes scales with the bandwidth of the interconnecting network and the HPC cluster's domain decomposition, while the latter is hidden from the visualisation and can change dynamically. We demonstrate the capability of our query-driven approach with a turbulent mixing dataset, and show that it supports interactive data exploration on HPC systems.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W. Widanagamaachchi, Cameron Christensen, P. Bremer, Valerio Pascucci
{"title":"Interactive exploration of large-scale time-varying data using dynamic tracking graphs","authors":"W. Widanagamaachchi, Cameron Christensen, P. Bremer, Valerio Pascucci","doi":"10.1109/LDAV.2012.6378962","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378962","url":null,"abstract":"Exploring and analyzing the temporal evolution of features in large-scale time-varying datasets is a common problem in many areas of science and engineering. One natural representation of such data is tracking graphs, i.e., constrained graph layouts that use one spatial dimension to indicate time and show the “tracks” of each feature as it evolves, merges or disappears. However, for practical data sets creating the corresponding optimal graph layouts that minimize the number of intersections can take hours to compute with existing techniques. Furthermore, the resulting graphs are often unmanageably large and complex even with an ideal layout. Finally, due to the cost of the layout, changing the feature definition, e.g. by changing an iso-value, or analyzing properly adjusted sub-graphs is infeasible. To address these challenges, this paper presents a new framework that couples hierarchical feature definitions with progressive graph layout algorithms to provide an interactive exploration of dynamically constructed tracking graphs. Our system enables users to change feature definitions on-the-fly and filter features using arbitrary attributes while providing an interactive view of the resulting tracking graphs. Furthermore, the graph display is integrated into a linked view system that provides a traditional 3D view of the current set of features and allows a cross-linked selection to enable a fully flexible spatio-temporal exploration of data. We demonstrate the utility of our approach with several large-scale scientific simulations from combustion science.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125614317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visual analysis of massive web session data","authors":"Zeqian Shen, Jishang Wei, Neel Sundaresan, K. Ma","doi":"10.1109/LDAV.2012.6378977","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378977","url":null,"abstract":"Tracking and recording users' browsing behaviors on the web down to individual mouse clicks can create massive web session logs. While such web session data contains valuable information about user behaviors, the ever-increasing data size has placed a big challenge to analyzing and visualizing the data. An efficient data analysis framework requires both powerful computational analysis and interactive visualization. Following the visual analytics mantra “Analyze first, show the important, zoom, filter and analyze further, details on demand”, we introduce a two-tier visual analysis system, TrailExplorer2, to discover knowledge from massive log data. The system supports a visual analysis process iterating between two steps: querying web sessions and visually analyzing the retrieved data. The query happens at the lower tier where terabytes of web session data are processed in a cluster. At the upper tier, the extracted web sessions with much smaller scale are visualized on a personal computer for interactive exploration. Our system visualizes a sorted list of web sessions' temporal patterns and enables data exploration at different levels of details. The query-visualization-exploration process iterates until a satisfactory conclusion is achieved. We present two case studies of TrailExplorer2 using real world session data from eBay to demonstrate the system's effectiveness.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chun-Ming Chen, B. Nouanesengsy, Teng-Yok Lee, Han-Wei Shen
{"title":"Flow-guided file layout for out-of-core pathline computation","authors":"Chun-Ming Chen, B. Nouanesengsy, Teng-Yok Lee, Han-Wei Shen","doi":"10.1109/LDAV.2012.6378984","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378984","url":null,"abstract":"As CPU processing power becomes more powerful and storage capacity increases, performing data-intensive visualization computations involving large data on a desktop computer becomes an increasingly viable option. Desktops, though, usually lack the memory capacity required to load such large data at once, and thus the cost of I/O becomes a major bottleneck for the necessary out-of-core computation. Among techniques that reduce runtime I/O cost, reordering the file layout to increase data locality has become popular in recent years. However, file layout techniques for time-varying scientific data, especially for time-varying flow fields, have been rarely discussed. In this paper, we evaluate the performance impact of utilizing a file layout method for out-of-core time-varying flow visualization. We extend a graph-based representation of flow fields, originally developed for static vector fields, to time-varying flow fields, and apply a graph layout algorithm to order data blocks to be written to disk. Benefits from the generated file layouts are evaluated using various parameters and seeding scenarios.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133461775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interactive transfer function design on large multiresolution volumes","authors":"Steven Martin, Han-Wei Shen","doi":"10.1109/LDAV.2012.6378971","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378971","url":null,"abstract":"Interactive transfer function design techniques seek to leverage user knowledge to facilitate the discovery of data salience. In this process, interactive volume rendering is typically a necessity. Interactive volume rendering of large-scale data on workstations is often accomplished through the use of level of detail techniques, prioritizing information deemed to be salient over information deemed to be unimportant. If salience is not known a priori, and interactive transfer function design techniques that depend on volume rendering are to be applied to large-scale data using level of detail selection, then there is a cyclic dependency. Techniques must be applied that can support simultaneous development of salience both for the transfer function design technique and the level of detail selection technique. Building on recent work in LOD selection, we propose an interactive transfer function design technique that enables incremental salience discovery to support simultaneous construction of transfer functions and LOD selections on large-scale data.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130086783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Wylie, IV WarrenL.Davis, Daniel M. Dunlavy, J. Baumes
{"title":"Using NoSQL databases for streaming network analysis","authors":"B. Wylie, IV WarrenL.Davis, Daniel M. Dunlavy, J. Baumes","doi":"10.1109/LDAV.2012.6378986","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378986","url":null,"abstract":"The high-volume, low-latency world of network traffic presents significant obstacles for complex analysis techniques. The unique challenge of adapting powerful but high-latency models to realtime network streams is the basis of our cyber security project. In this paper we discuss our use of NoSQL databases in a framework that enables the application of computationally expensive models against a real-time network data stream. We describe how this approach transforms the highly constrained (and sometimes arcane) world of real-time network analysis into a more developer friendly model that relaxes many of the traditional constraints associated with streaming data. Our primary use of the system is for conducting streaming text analysis and classification activities on a network link receiving ~200,000 emails per day.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shusen Liu, J. Levine, P. Bremer, Valerio Pascucci
{"title":"Gaussian mixture model based volume visualization","authors":"Shusen Liu, J. Levine, P. Bremer, Valerio Pascucci","doi":"10.1109/LDAV.2012.6378978","DOIUrl":"https://doi.org/10.1109/LDAV.2012.6378978","url":null,"abstract":"Representing uncertainty when creating visualizations is becoming more indispensable to understand and analyze scientific data. Uncertainty may come from different sources, such as, ensembles of experiments or unavoidable information loss when performing data reduction. One natural model to represent uncertainty is to assume that each position in space instead of a single value may take on a distribution of values. In this paper we present a new volume rendering method using per voxel Gaussian mixture models (GMMs) as the input data representation. GMMs are an elegant and compact way to drastically reduce the amount of data stored while still enabling realtime data access and rendering on the GPU. Our renderer offers efficient sampling of the data distribution, generating renderings of the data that flicker at each frame to indicate high variance. We can accumulate samples as well to generate still frames of the data, which preserve additional details in the data as compared to either traditional scalar indicators (such as a mean or a single nearest neighbor down sample) or to fitting the data with only a single Gaussian per voxel. We demonstrate the effectiveness of our method using ensembles of climate simulations and MRI scans as well as the down sampling of large scalar fields as examples.","PeriodicalId":129172,"journal":{"name":"IEEE Symposium on Large Data Analysis and Visualization (LDAV)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133498980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}