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

ieee symposium on Visual Analytics Science and Technology (VAST)

作者： E. Wes Bethel Scott Campbell Eli Dart Kurt Stockinger Kesheng Wu Computational Research Division Lawrence Berkeley National Laboratory University of California Berkeley CA National Energy Research Scientific Computing Center Division Lawrence Berkeley National Laboratory University of California Berkeley CA USA Energy Sciences Network

Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the time required for data filtering, querying, hypothesis testing and knowledge discovery in the domain of network connection data analysis. We show that use of compressed bitmap indexing can quickly answer queries in an interactive visual data analysis application, and compare its performance with two alternatives for serial and parallel filtering/querying on 2.5 billion records' worth of network connection data collected over a period of 42 weeks. Our approach to visual network connection data exploration centers on two primary factors: interactive ad-hoc and multiresolution query formulation and execution over n dimensions and visual display of the n-dimensional histogram results. This combination is applied in a case study to detect a distributed network scan and to then identify the set of remote hosts participating in the attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools

关键词： Acceleration Telecommunication traffic data visualization data analysis Filtering Time factors Knowledge management Technology management Testing Indexing

来源：评论

学校读者我要写书评

暂无评论

A comparative study of popular interpolation and integration methods for use in computed tomography

A comparative study of popular interpolation and integration...

引用

ieee International symposium on Biomedical Imaging

作者： Fang Xu K. Mueller Center for Visual Computing Computer Science Stony Brook University USA

ISBN: (纸本)078039576X

We compare various popular methods available for projection and backprojection in CT. Assuming linear rays and a simple density integration along them, we consider both line- and area-based methods. Here, two key components govern the quality of a projection result, given the discrete nature of the data and reconstruction result: interpolation and integration. Both of these are studied here. In order to separate these fundamental issues from those related to perspective fan and cone-beam effects, we restrict ourselves to a parallel-beam projection geometry. We also compare these different methods in light of a possible efficient implementation on programmable commodity graphics hardware (GPUs). To this end, we propose a new method for interpolation based on hexagonal subsampling, which achieves superior results. In order to achieve a data-independent comparison, we employ a dataset of very high and uniform frequency content, the so-called Marschner-Lobb dataset

关键词： Interpolation Computed tomography Kernel Filters Frequency visualization Computer science Taylor series Testing Equations

来源：评论

学校读者我要写书评

暂无评论

PROOF - The parallel ROOT Facility

PROOF - The Parallel ROOT Facility

引用

International symposium on High Performance Distributed Computing

作者： D. Feichtinger P. Canal C. Reed C. Loizides M. Ballintijn F. Rademakers A.J. Peters G. Kickinger J. Iwaszkiewicz G. Ganis R. Brun B. Bellenot PSI Villingen Switzerland FNAL Batavia IL USA MIT Cambridge MA USA CERN Geneva Switzerland

The parallel ROOT facility, PROOF, enables the interactive analysis of distributed data sets in a transparent way. It exploits the inherent parallelism in data sets of uncorrelated events via a multi-tier architecture that optimizes I/O and CPU utilization in heterogeneous clusters with distributed storage. On a grid, PROOF can use the available services to find out the location of data to analyze and the resources to use. Dedicated PROOF-enabled test-beds are now being deployed for testing by the LHC experiments. Being part of the ROOT framework PROOF inherits the benefits of a high performance object-oriented storage system and a wealth of statistical and visualization tools. The basic ideas and architecture underlying the PROOF project are described, together with the status of the project, focusing mostly on the issues of data access optimization, scheduling of user sessions and user interface

关键词： data analysis parallel processing Testing large Hadron Collider Irrigation data visualization Processor scheduling User interfaces Distributed computing data models

来源：评论

学校读者我要写书评

暂无评论

Distributed Physical Based Simulations for large VR Applications

Distributed Physical Based Simulations for Large VR Applicat...

引用

ieee Annual International symposium Virtual Reality

作者： J. Allard B. Raffin ID-IMAG CNRS/INPG/INRIA/UJF Grenoble France

We present a novel software framework for developing highly animated virtual reality applications. Using a modular application design, our goal is to alleviate software engineering issues while yielding efficient execution on parallel machines. We target worlds involving numerous animated objects managed by physical based simulations. Mixing rigid objects, fluids, mass-spring or other deformable objects leads to complex interactions between them. Today no unified simulation algorithm with a reasonable complexity is available to manage all these types of objects. We propose a framework for coupling and distributing existing algorithms. We reuse and extend the data-flow model where an application is built from modules exchanging data through connections. The model relies on two main classes of modules, animators and interactors. Animators are responsible for updating objects’ states from forces applied to them. These forces are computed in parallel by interactors using the objects’ states they receive from animators. The network interconnecting modules can be progressively optimized. From a simple fully connected network enforcing a synchronous semantics, it can evolve towards an active network able to implement a bounding volume based dynamic routing or an asynchronous data re-sampling. As a result, we present an application managing interactions between rigid objects, mass-spring objects and a fluid. It is executed in real-time on a 54 processors cluster driving 5 cameras and 16 projectors for user interactions.

关键词： Virtual reality Animation graphics Application software Software engineering Cameras Deformable models Biological system modeling parallel machines Fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Information visualization at 10

引用

ieee COMPUTER graphics AND APPLICATIONS 2005年第1期25卷 12-14页

作者： Eick, SG Univ Illinois Chicago IL 60680 USA

The article focuses on the 10th anniversary of the ieee Computer Society's Information visualization symposium. At 10, information visualization is vigorous and thriving. In the early years, the symposium had difficulty attracting enough good papers to fill the slots. Today it receives so many excellent papers that the acceptance rate is low. The field has become an academic success. Some projects have had notable commercial success. Display technologies are in the middle of a massive transition. Conventional CRTs are being swapped for large, megapixel flat-screen displays. This transition started with increasing display sizes in laptops and has accelerated as new as display technologies have moved into widely deployed consumer goods such as high-definition televisions. The result of these technology changes is that screen real estate is increasing. Seventeen- and 21-inch flat- Information visualization is domain specific. The most interesting visualizations solve problems. An emerging class of problem involves analyzing data that arrives in a stream. Massive sensor systems, video cameras, and transaction-processing systems generate real-time data streams.

关键词： CONFERENCES & conventions INFORMATION science COMMUNICATION INFORMATION display systems INFORMATION visualization

来源：评论

学校读者我要写书评

暂无评论

Interactive parallel visualization of large particle datasets

引用

parallel COMPUTING 2005年第2期31卷 243-260页

作者： Liang, K Monger, P Couchman, H McMaster Univ Res & HPC Support Hamilton ON L8S 4M1 Canada McMaster Univ Dept Phys & Astron Hamilton ON L8S 4M1 Canada

This paper presents a new interactive parallel visualization method for large particle datasets by directly rendering individual particles based on a parallel rendering cluster. A frame rate of 9 frames-per-second is achieved for 256 3 particles using 7 render nodes and a display node. This provides real time interaction and interactive exploration of large datasets, which has been a challenge for scientific visualization and other real time data mining applications. A dynamic data distribution technique is designed for highlighting a subset of the particle volume. It maintains load balance of the system and minimizes network traffic by reconfiguring the rendering chain. Experiments show that on a given subset, interactive manipulation of the subset usually requires less than 3% of the particles inside the subset to be redistributed among all render nodes. The method can be easily extended to other large datasets such as hydrodynamic turbulence, fluid dynamics, and so on. (c) 2005 Elsevier B.V. All rights reserved.

关键词： interactive graphics parallel visualization high performance scientific visualization distributed/network graphics volume rendering

来源：评论

学校读者我要写书评

暂无评论

Interactive parallel visualization of large particle datasets

Interactive parallel visualization of large particle dataset...

引用

symposium on parallel graphics and visualization

作者： Liang, K Monger, P Couchman, H McMaster Univ Res & HPC Support Hamilton ON L8S 4M1 Canada McMaster Univ Dept Phys & Astron Hamilton ON L8S 4M1 Canada

关键词： interactive graphics parallel visualization high performance scientific visualization distributed/network graphics volume rendering

来源：评论

学校读者我要写书评

暂无评论

A study of I/O methods for parallel visualization of large-scale data

引用

parallel COMPUTING 2005年第2期31卷 167-183页

作者： Yu, HF Ma, KL Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

This paper presents two parallel I/O methods for the visualization of time-varying volume data in a high-performance computing environment. We discuss the interplay between the parallel renderer, I/O strategy, and file system, and show the results of our study on the performance of the I/O strategies with and without MPI parallel I/O support. The targeted application is earthquake modeling using a large 3D unstructured mesh consisting of one hundred millions cells. Our test results on the HP/Cornpaq AlphaServer operated at the Pittsburgh Supercomputing Center demonstrate that the I/O methods effectively remove the I/O bottlenecks commonly present in time-varying data visualization, and therefore help significantly lower interfrarne delay. This high-performance visualization solution allows scientists to explore their data in the temporal, spatial, and visualization domains at high resolution. Such new explorability, likely not presently available to most computational science groups, will help lead to many new insights into the modeled physical and chemical processes. (c) 2005 Elsevier B.V. All rights reserved.

关键词： high-performance computing massively parallel supercomputing MPI scientific visualization parallel I/O parallel rendering time-varying data volume rendering

来源：评论

学校读者我要写书评

暂无评论

large volume visualization of compressed time-dependent datasets on GPU clusters

引用

parallel COMPUTING 2005年第2期31卷 205-219页

作者： Strengert, M Magallón, M Weiskopf, D Guthe, S Ertl, T Univ Stuttgart Inst Visualizat & Interact Syst D-70569 Stuttgart Germany Univ Costa Rica Escuela Fis San Pedro 2060 Costa Rica Univ Tubingen GRIS WSI D-72076 Tubingen Germany

We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object space, and the intermediate images are combined to a final picture in a sort-last approach. Hierarchical wavelet compression is applied to increase the effective size of volumes that can be handled. An adaptive rendering mechanism takes into account the viewing parameters and the properties of the data set to adjust the texture resolution and number of slices. We discuss the specific issues of this adaptive and hierarchical approach in the context of a distributed memory architecture and present corresponding solutions. Furthermore, our compositing scheme takes into account the footprints of volume bricks to minimize the costs for reading from framebuffer, network communication, and blending. A detailed performance analysis is provided for several network, CPU, and GPU architectures-and scaling characteristics of the parallel system are discussed. For example, our tests on a eight-node AMD64 cluster with InfiniBand show a rendering speed of 6 frames per second for a 2048 x 1024 x 1878 data set on a 1024(2) viewport. (c) 2005 Elsevier B.V. All rights reserved.

关键词： graphics systems distributed/network graphics viewing algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel sets: Visual analysis of categorical data

Parallel sets: Visual analysis of categorical data

引用

ieee symposium on Information visualization (InfoVis 05)

作者： Bendix, F Kosara, R Hauser, H VRVis Research Center Austria Inte:Ligand

ISBN: (纸本)078039464X

The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. parallel Sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency-based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows efficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using parallel Sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.

关键词： categorical data meta information interaction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：