2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)最新文献

筛选
英文 中文
Parallel Partial Reduction for Large-Scale Data Analysis and Visualization 面向大规模数据分析和可视化的并行部分约简
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739165
Wenbin He, Hanqi Guo, T. Peterka, S. Di, F. Cappello, Han-Wei Shen
{"title":"Parallel Partial Reduction for Large-Scale Data Analysis and Visualization","authors":"Wenbin He, Hanqi Guo, T. Peterka, S. Di, F. Cappello, Han-Wei Shen","doi":"10.1109/LDAV.2018.8739165","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739165","url":null,"abstract":"We present a novel partial reduction algorithm to aggregate sparsely distributed intermediate results that are generated by data-parallel analysis and visualization algorithms. Applications of partial reduction include flow trajectory analysis, big data online analytical processing, and volume rendering. Unlike traditional full parallel reduction that exchanges dense data across all processes, the purpose of partial reduction is to exchange only intermediate results that correspond to the same query, such as line segments of the same flow trajectory. To this end, we design a three-stage algorithm that minimizes the communication cost: (1) partitioning the result space into groups; (2) constructing and optimizing the reduction partners for each group; and (3) initiating collective reduction operations for all groups concurrently. Both theoretical and empirical analyses show that our algorithm outperforms the traditional methods when the intermediate results are sparsely distributed. We also demonstrate the effectiveness of our algorithm for flow visualization, big log data analysis, and volume rendering.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128864183","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}
引用次数: 0
A Large Data Visualization Framework for SPARC64 fx HPC Systems - Case Study: K Computer Operational Environment - sparc64fx HPC系统的大数据可视化框架-案例研究:K计算机操作环境-
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739214
J. Nonaka, K. Ono, Naohisa Sakamoto, Kengo Hayashi, Motohiko Matsuda, F. Shoji, Kentaro Oku, M. Fujita, Kazuma Hatta
{"title":"A Large Data Visualization Framework for SPARC64 fx HPC Systems - Case Study: K Computer Operational Environment -","authors":"J. Nonaka, K. Ono, Naohisa Sakamoto, Kengo Hayashi, Motohiko Matsuda, F. Shoji, Kentaro Oku, M. Fujita, Kazuma Hatta","doi":"10.1109/LDAV.2018.8739214","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739214","url":null,"abstract":"Leading-edge supercomputer systems have been designed to achieve the highest computational performance possible for running a wide variety of large-scale simulations, and the pre- and post-processing are usually not considered in the main design feature. Although supercomputer systems may have peculiar CPU architecture, the auxiliary computational systems tend to use commodity based hardware and software in the form of servers and clusters. In the case of the K computer operational environment, at RIKEN R-CCS, the supercomputer itself is based on SPARC64 fx CPU architecture, and pre- and post-processing servers are based on traditional x86 CPU architecture. In this poster we present a large data visualization environment developed for this peculiar HPC operational environment, presenting some of the efforts made to meet the large data visualization needs. It is publicly known that the next-generation leading-edge Japanese supercomputer will abandon this CPU architecture in favor of another architecture, but we expect that some of the knowledge obtained in this development will also be useful for this future coming supercomputer system.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374467","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}
引用次数: 0
Method for Improving RadViz’s Navigation Function Based on Focusing and Filtering 基于聚焦滤波的RadViz导航功能改进方法
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739161
Hyunwoo Han, Taerin Yoon, Hyoji Ha, Juwon Hong, Kyungwon Lee
{"title":"Method for Improving RadViz’s Navigation Function Based on Focusing and Filtering","authors":"Hyunwoo Han, Taerin Yoon, Hyoji Ha, Juwon Hong, Kyungwon Lee","doi":"10.1109/LDAV.2018.8739161","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739161","url":null,"abstract":"Figure 1Improved visualization system of RadViz. The dimension of the data is indicated by the dimensional anchor(a). And desired data instances can be focused through a process(b-1, b-2) of grouping by dragging similar dimensional anchors. When user selects a specific dimension, Data distribution histogram(c-1) is generated. Through manipulation of it(c-2), user can navigate data instances by filtering. Also, multi-variable values of the selected instances can be verified through the Radar chart(d) and the table(e). (https://radviz-focus.hanu.io/)For user to analyze large data set with various attributes as desired, rearranging data based on purpose is vital. This study proposes a method to navigate data with a desired purpose of user by improving RadViz visualization through focusing and filtering. To help understand visualization, user studies were conducted using the music data of Spotify. As a result, our system is discovered to be effective at classifying large data set of music with attributes and navigating desired music efficiently.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"402 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123527773","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}
引用次数: 0
Towards In-Situ Vortex Identification for Peta-Scale CFD Using Contour Trees 基于轮廓树的peta尺度CFD原位涡识别研究
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739233
Marius K. Koch, P. Kelly, P. Vincent
{"title":"Towards In-Situ Vortex Identification for Peta-Scale CFD Using Contour Trees","authors":"Marius K. Koch, P. Kelly, P. Vincent","doi":"10.1109/LDAV.2018.8739233","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739233","url":null,"abstract":"Turbulent flows exist in many fields of science and occur in a wide range of engineering applications. While in the past broad knowledge has been established regarding the statistical properties of turbulence at a range of Reynolds numbers, there is a lack of under-standing of the detailed structure of these flows. Since the physical processes involve a vast number of structures, extremely large data sets are required to fully resolve a flow field in both space and time. To make the analysis of such data sets possible, we propose a frame-work that uses state-of-the-art contour tree construction algorithms to identify, classify and track vortices in turbulent flow fields produced by large-scale high-fidelity massively-parallel computational fluid dynamics solvers such as PyFR. Since disk capacity and I/O have become a bottleneck for such large-scale simulations, the proposed framework will be applied in-situ, while relevant data is still in device memory.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369716","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}
引用次数: 0
Complexity Estimation for Feature Tracking Data 特征跟踪数据的复杂性估计
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739231
D. Helmrich, Andrea Schnorr, T. Kuhlen, B. Hentschel
{"title":"Complexity Estimation for Feature Tracking Data","authors":"D. Helmrich, Andrea Schnorr, T. Kuhlen, B. Hentschel","doi":"10.1109/LDAV.2018.8739231","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739231","url":null,"abstract":"Figure 1.Left: Synthetic Voronoi data set to mimick the behavior of dissipation elements. Points are seeded randomly inside this data set and each volume cell is labeled with its cell center. These are colored by cell center ID. Middle: Dissipation element data set, colored by ID Right: Dissipation element data set, colored by predicted complexity of the problemFeature tracking is a method of time-varying data analysis. Due to the complexity of the underlying problem, different feature tracking algorithms have different levels of correctness in certain use cases. However, there is no efficient way to evaluate their performance on simulation data since there is no ground-truth easily obtainable. Synthetic data is a way to ensure a minimum level of correctness, though there are limits to their expressiveness when comparing the results to simulation data. To close this gap, we calculate a synthetic data set and use its results to extract a hypothesis about the algorithm performance that we can apply to simulation data.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121733385","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}
引用次数: 0
LDAV 2018 TOC
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/ldav.2018.8739230
{"title":"LDAV 2018 TOC","authors":"","doi":"10.1109/ldav.2018.8739230","DOIUrl":"https://doi.org/10.1109/ldav.2018.8739230","url":null,"abstract":"","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131628170","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}
引用次数: 0
A Flow Visualization Using Parallel 3D Line Integral Convolution for Large Scale Unstructured Grid Data 基于并行三维线积分卷积的大规模非结构化网格数据流可视化
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739209
Y. Liao, H. Matsui, O. Kreylos, L. Kellogg
{"title":"A Flow Visualization Using Parallel 3D Line Integral Convolution for Large Scale Unstructured Grid Data","authors":"Y. Liao, H. Matsui, O. Kreylos, L. Kellogg","doi":"10.1109/LDAV.2018.8739209","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739209","url":null,"abstract":"One of the greatest challenges facing scientists doing large computation of vector fields in a distributed parallel setting is the need for optimal parallel algorithms for flow visualization. To address this need, we present a new flow visualization method based on parallel 3D line integral convolution (LIC). Our approach uses the fact that 3D LIC only needs limited local information to design an embarrassingly parallel model with a trade-off between the additional memory cost of external cells and the time cost for communication. All data required for each process can be stored in either a local data block or the external cells which are sets of exterior data surrounding the local partition. One problem for parallel LIC is that equal domain size decomposition of the data cannot guarantee balanced parallel processes. To achieve a load-balanced visualization process, we repartition data using an estimate of the LIC computation time. In addition, to minimize the memory cost, we introduce a vector-driven external cell expansion method to reduce the required memory cost. We find that we can use fewer external cells with minimal loss of visual quality.We evaluate the performance of our visualization method by first comparing its parallel scalability with traditional integral field line visualization. Next, we compare our new partition method with other data partition methods to verify that the workload of our model is more balanced. Finally, we compare our external cell expansion method with a traditional layer-based external cell expansion method. Consequently, together with the new partition and external cell expansion methods, our parallel 3D LIC visualization proves to be an efficient and well-balanced parallel flow visualization with limited extra memory cost and a large saving of communication time.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116036563","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}
引用次数: 2
Adaptive Encoder Settings for Interactive Remote Visualisation on High-Resolution Displays 高分辨率显示器上交互式远程可视化的自适应编码器设置
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739215
Florian Friess, Mathias Landwehr, Valentin Bruder, S. Frey, T. Ertl
{"title":"Adaptive Encoder Settings for Interactive Remote Visualisation on High-Resolution Displays","authors":"Florian Friess, Mathias Landwehr, Valentin Bruder, S. Frey, T. Ertl","doi":"10.1109/LDAV.2018.8739215","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739215","url":null,"abstract":"We present an approach that dynamically adapts encoder settings for image tiles to yield the best possible quality for a given bandwidth. This reduces the overall size of the image while preserving details. Our application determines the encoding settings in two steps. In the first step, we predict the quality and size of the tiles for different encoding settings using a convolutional neural network. In the second step, we assign the optimal encoder setting to each tile, so that the overall size of the image is lower than a predetermined threshold. Commonly, for tiles that contain complicated structures, a high quality setting is used in order to prevent major information loss, while quality settings are lowered for others to keep the size below the threshold. We demonstrate that we can reduce the overall size of the image while preserving the details in areas of interest using the example of both particle and volume visualisation applications.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394546","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}
引用次数: 1
Foundations of Multivariate Functional Approximation for Scientific Data 科学数据的多元泛函逼近基础
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739195
T. Peterka, Y. Nashed, I. Grindeanu, V. Mahadevan, Raine Yeh, X. Tricoche
{"title":"Foundations of Multivariate Functional Approximation for Scientific Data","authors":"T. Peterka, Y. Nashed, I. Grindeanu, V. Mahadevan, Raine Yeh, X. Tricoche","doi":"10.1109/LDAV.2018.8739195","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739195","url":null,"abstract":"The size and complexity of scientific data are rapidly outpacing our ability to manage, analyze, visualize, and draw conclusions from the results. One way to streamline scientific data processing is to transform the data model to one that is not only more efficient but that facilitates analytical reasoning. To this end, we are investigating modeling discrete scientific data by a functional basis representation based on a tensor product of nonuniform rational B-spline functions (NURBS). The functional model is an approximation that is more efficient to communicate, store, and analyze than the original form, while having geometric and analytic properties making it useful for further analysis without translating back to the discrete form. This paper presents four main contributions. The first is modeling in high dimensions, not just curves or surfaces but volumes and hyper-volumes. The second is an adaptive algorithm that adds knots and control points until the maximum error is below a threshold set by the user. The adaptive algorithm also works in high dimensions. The third is precise evaluation of values and high-order derivatives anywhere in the domain, again in high-dimensional space. The fourth contribution is parallelization on high-performance supercomputers. We evaluate our model using both synthetic and actual scientific datasets.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128094421","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}
引用次数: 14
Exploring Visualization Techniques with HACC Simulation Data 探索可视化技术与HACC仿真数据
2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV) Pub Date : 2018-10-01 DOI: 10.1109/LDAV.2018.8739228
Joseph Adamo, J. D. Emberson, Edouard B. Brooks, S. Rizzi, J. Insley, M. Papka
{"title":"Exploring Visualization Techniques with HACC Simulation Data","authors":"Joseph Adamo, J. D. Emberson, Edouard B. Brooks, S. Rizzi, J. Insley, M. Papka","doi":"10.1109/LDAV.2018.8739228","DOIUrl":"https://doi.org/10.1109/LDAV.2018.8739228","url":null,"abstract":"In this project we explore several different techniques for visualizing data created by Hardware/Hybrid Accelerated Cosmology Code (HACC) cosmology simulations. We present four methods that have thus far been explored. Mainly, we discuss visualizing data through ParaView, vl3, SPH interpolation, and virtual reality environments. We display our preliminary results, as well as our plans to begin applying our techniques to large scale data sets.","PeriodicalId":241591,"journal":{"name":"2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867232","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书