检索结果-内蒙古大学图书馆

ieee symposium on visualization for Cyber Security (VizSec)

作者： Siva Sandeep Subramanian Parab Pushparaj Zerong Liu Aidong Lu Department of Computer Science University of North Carolina at Charlotte

ISBN: (数字)9781728138763

ISBN: (纸本)9781728138770

Online social networks are prone to be targeted by various frauds and attacks, which are difficult to detect due to their complexity and variations. The challenge is to make sense of all information with suitable exploration tools for different groups of users. This project focuses on an explainable visualization approach to study collaborative behaviors of vandal users on Wikipedia. Our approach creates visualization with commonly used techniques from cartography and statistical graphics that are familiar to the general public for effectiveness and explainability. We have built a large-scale visualization system which supports an illustrative interface with multiple data query, filtering, analysis, and interactive exploration functions. Examples and case studies are provided to demonstrate that our approach can be used effectively for a set of Wikipedia behavior analysis tasks.

关键词： data visualization Encyclopedias Electronic publishing Internet visualization Collaboration

来源：评论

学校读者我要写书评

暂无评论

Efficient Randomized Hierarchy Construction for Interactive visualization of large Scale Point Clouds

Efficient Randomized Hierarchy Construction for Interactive ...

引用

ieee International Conference on data Science in Cyberspace (DSC)

作者： Lai Kang Jie Jiang Yingmei Wei Yuxiang Xie College of Systems Engineering National University of Defense Technology Changsha kanglai China

Point cloud is widely used in various applications like 3D geographical information system (GIS), cultural heritage preservation, urban planning, etc. Most of these applications require interactive visualization of massive point cloud, which is challenging since their sizes are usually very large. This paper presents a method to construct a hierarchical data structure for point cloud data organization and real-time rendering, with an emphasis on speeding up the construction processing. The overall pipeline consists of the following three steps: first, the spatial extent of the whole dataset is divided into nested blocks; second, data in each block is reorganized using a octree based on random subsampling in a parallel fashion; finally, octree of all blocks are merged into a consistent hierarchy. The effectiveness and efficiency of the above approach was demonstrated by applying it to a set of point clouds of varying sizes reconstructed using photogrammetry pipeline.

关键词： Three-dimensional displays Rendering (computer graphics) Octrees data visualization Systems engineering and theory Pipelines

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Visual Guidance in Limited Field-of-View Head-Mounted Displays

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2018年第11期24卷 2983-2992页

作者： Bork, Felix Schnelzer, Christian Eck, Ulrich Navab, Nassir Tech Univ Munich Munich Germany

Understanding, navigating, and performing goal-oriented actions in Mixed Reality (MR) environments is a challenging task and requires adequate information conveyance about the location of all virtual objects in a scene. Current Head-Mounted Displays (HMDs) have a limited field-of-view where augmented objects may be displayed. Furthermore, complex MR environments may be comprised of a large number of objects which can be distributed in the extended surrounding space of the user. This paper presents two novel techniques for visually guiding the attention of users towards out-of-view objects in HMD-based MR: the 3D Radar and the Mirror Ball. We evaluate our approaches against existing techniques during three different object collection scenarios, which simulate real-world exploratory and goal-oriented visual search tasks. To better understand how the different visualizations guide the attention of users, we analyzed the head rotation data for all techniques and introduce a novel method to evaluate and classify head rotation trajectories. Our findings provide supporting evidence that the type of visual guidance technique impacts the way users search for virtual objects in MR.

关键词： Mixed / Augmented reality visualization design and evaluation methods

来源：评论

学校读者我要写书评

暂无评论

2018 ieee 8th symposium on large data Analysis and visualization, LDAV 2018

2018 IEEE 8th Symposium on Large Data Analysis and Visualiza...

引用

8th ieee symposium on large data Analysis and visualization, LDAV 2018

ISBN: (纸本)9781538668733

The proceedings contain 20 papers. The topics discussed include: method for improving RadViz's navigation function based on focusing and filtering;parallel partial reduction for large-scale data analysis and visualization;in situ visualization and analysis to design large scale experiments in computational fluid dynamics;citation network visualization of reference papers based on influence groups;visual analysis of simulation uncertainty using cost-effective sampling;foundations of multivariate functional approximation for scientific data;lifted Wasserstein matcher for fast and robust topology tracking;and VOIDGA: a view-approximation oriented image database generation approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A GPU parallel Approximation Algorithm for Scheduling parallel Identical Machines to Minimize Makespan 32

A GPU Parallel Approximation Algorithm for Scheduling Parall...

引用

32nd ieee International parallel and Distributed Processing symposium (IPDPS)

作者： Li, Yuanzhe Ghalami, Laleh Schwiebert, Loren Grosu, Daniel Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9781538655559

We present a parallel approximation algorithm for the problem of scheduling jobs on parallel identical machines to minimize makespan which is designed and optimized for running efficiently on the GPU. The algorithm is a Polynomial Time Approximation Scheme (PTAS) based on a higher-dimensional dynamic programming approach, where dimensionality refers to the number of variables in the dynamic programming equation characterizing the problem. The main component of our design consists of a novel data-partitioning technique that is employed to accelerate the higher-dimensional dynamic programming component of the algorithm. We present performance results to demonstrate how our proposed design improves the GPU utilization and makes it possible to solve large higher-dimensional dynamic programming problems with the limited GPU memory. Experimental results show that the GPU implementation outperforms the optimized OpenMP implementation of the approximation algorithm.

关键词： graphics processing units Dynamic programming Heuristic algorithms Approximation algorithms parallel processing Schedules Partitioning algorithms"

来源：评论

学校读者我要写书评

暂无评论

BabelFlow: An Embedded Domain Specific Language for parallel Analysis and visualization 32

BabelFlow: An Embedded Domain Specific Language for Parallel...

引用

32nd ieee International parallel and Distributed Processing symposium (IPDPS)

作者： Petruzza, Steve Treichler, Sean Pascucci, Valerio Bremer, Peer-Timo Univ Utah Salt Lake City UT 84112 USA Stanford Univ Stanford CA 94305 USA Lawrence Livermore Natl Lab Livermore CA USA

ISBN: (纸本)9781538643686

The rapid growth in simulation data requires large-scale parallel implementations of scientific analysis and visualization algorithms, both to produce results within an acceptable timeframe and to enable in situ deployment. However, efficient and scalable implementations, especially of more complex analysis approaches, require not only advanced algorithms, but also an in-depth knowledge of the underlying runtime. Furthermore, different machine configurations and different applications may favor different runtimes, i.e., MPI vs Charm++ vs Legion, etc., and different hardware architectures. This diversity makes developing and maintaining a broadly applicable analysis software infrastructure challenging. We address some of these problems by explicitly separating the implementation of individual tasks of an algorithm from the dataflow connecting these tasks. In particular, we present an embedded domain specific language (EDSL) to describe algorithms using a new task graph abstraction. This task graph is then executed on top of one of several available runtimes (MPI, Charm++, Legion) using a thin layer of library calls. We demonstrate the flexibility and performance of this approach using three different large scale analysis and visualization use cases, i.e., topological analysis, rendering and compositing dataflow, and image registration of large microscopy scans. Despite the unavoidable overheads of a generic solution, our approach demonstrates performance portability at scale, and, in some cases, outperforms hand-optimized implementations.

关键词： Embedded DSL User productivity In-situ analysis Simulation runtime systems Programming models

来源：评论

学校读者我要写书评

暂无评论

VisIt-OSPRay: Toward an exascale volume visualization system

VisIt-OSPRay: Toward an exascale volume visualization system

引用

18th Eurographics symposium on parallel graphics and visualization, EGPGV 2018

作者： Wu, Qi Usher, Will Petruzza, Steve Kumar, Sidharth Wang, Feng Wald, Ingo Pascucci, Valerio Hansen, Charles D. Scientific Computing and Imaging Institute University of Utah United States Intel Corporation

ISBN: (纸本)9783038680543

large-scale simulations can easily produce data in excess of what can be efficiently visualized using production visualization software, making it challenging for scientists to gain insights from the results of these simulations. This trend is expected to grow with exascale. To meet this challenge, and run on the highly parallel hardware being deployed on HPC system, rendering systems in production visualization software must be redesigned to perform well at these new scales and levels of parallelism. In this work, we present VisIt-OSPRay, a high-performance, scalable, hybrid-parallel rendering system in VisIt, using OSPRay and IceT, coupled with PIDX for scalable I/O. We examine the scalability and memory efficiency of this system and investigate further areas for improvement to prepare VisIt for upcoming exascale workloads. © 2018 The Author(s)

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

GPU parallel IMPLEMENTATION OF GAS PLUME DETECTION IN HYPERSPECTRAL VIDEO SEQUENCES 38

GPU PARALLEL IMPLEMENTATION OF GAS PLUME DETECTION IN HYPERS...

引用

38th ieee International Geoscience and Remote Sensing symposium (IGARSS)

作者： Yu, Huimin Wu, Zebin Wei, Jie Xu, Yang Chanussot, Jocelyn Bertozzi, Andrea L. Shi, Linlin Wei, Zhihui Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China Univ Grenoble Alpes CNRS GIPSA Lab Grenoble INP F-38000 Grenoble France Univ Calif Los Angeles Dept Math Los Angeles CA 90024 USA

ISBN: (纸本)9781538671504

Gas plume detection is a challenging task in the field of remote sensing. Due to sensor development, it is now possible to detect and track chemical gas plumes with hyperspectral video sequences (HVS). For the purpose of high detection accuracy, it is important to explore spectral characteristic, and take full advantages of spatial continuity and temporal consistency in HVS. However, the high computational complexity and the large amount of data limit its application in time-critical scenarios. In this paper, we propose a GPU parallel implementation of gas plume detection in HVS, which properly exploits shared memory and intrinsic concurrency of the CUDA blocks, as well as parallel workload assignment and resource allocation. The experimental results demonstrate the proposed GPU parallel method has a considerable acceleration factor while retaining the same detection accuracy compared with the serial and multicore version.

关键词： Gas plume detection Hyperspectral video sequence graphics processing units (GPUs) parallel

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel CTL Model-Checking for Pushdown Systems 16

Efficient Parallel CTL Model-Checking for Pushdown Systems

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Chen, Xinyu Wei, Hansheng Ye, Xin Hao, Li Huang, Yanhong Shi, Jianqi East China Normal Univ Natl Trusted Embedded Software Engn Technol Res C Shanghai Peoples R China Hardware Software Codesign Technol & Applicat Eng Shanghai Peoples R China Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China LIPN Paris France Paris Univ 7 Paris France

ISBN: (纸本)9781728111414

A Pushdown system (PDS) is a finite transition system equipped with stacks that are allowed to accurately model procedure calls and mimic the program's stack. Therefore, a PDS is extensively used for the analysis and verification of sequential programs. The computational tree logic (CTL) model checking for PDS is reduced to an emptiness problem, which consists of computing the set of accepting configurations of an alternating Buchi PushDown System(ABPDS). When the PDSs are very large, the emptiness analysis can be time-consuming. In this study, we use the features of a Compute Unified Device Architecture (CUDA) to achieve the parallelism. First, we propose a parallel algorithm to conduct the emptiness analysis of the ABPDS in multi-threads. Thus we propose a partitioned alternating multi automaton, which is a parallel extension of the alternating multi automaton (AMA) to represent the infinite set of configurations for the alternating Pushdown System and demonstrate how the emptiness analysis can be conducted in parallel based on a partitioned alternating multi automaton. Second, the process of the emptiness analysis is irregular, which means it is difficult to allocate resources dynamically. In order to effectively utilize the graphics processing unit (GPU), we design a new data structure and use thread scheduling to fit the computing model. The algorithm is implemented in a tool and is compared to the PDS model checker PuMoC as a benchmark. The results demonstrate a significant performance speedup (average 50X and up to 180X).

关键词： Pushdown Systems CTL CUDA model-checking

来源：评论

学校读者我要写书评

暂无评论

parallel Partial Reduction for large-Scale data Analysis and visualization

Parallel Partial Reduction for Large-Scale Data Analysis and...

引用

ieee symposium on large data Analysis and visualization (LDAV)

作者： Wenbin He Hanqi Guo Tom Peterka Sheng Di Franck Cappello Han-Wei Shen Department of Computer Science and Engineering The Ohio State University Columbus OH USA Mathematics and Computer Science Division Argonne National Laboratory Lemont IL USA

ISBN: (纸本)9781538668740

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.

关键词： data visualization Distributed databases Rendering (computer graphics) Trajectory data analysis Histograms parallel processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：