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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,040 篇 会议
159 篇 期刊文献

馆藏范围

1,199 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

708 篇 工学
- 498 篇 软件工程
- 493 篇 计算机科学与技术...
- 202 篇 电气工程
- 33 篇 信息与通信工程
- 21 篇 机械工程
- 20 篇 电子科学与技术（可...
- 19 篇 力学（可授工学、理...
- 18 篇 控制科学与工程
- 17 篇 生物医学工程（可授...
- 16 篇 生物工程
- 15 篇 测绘科学与技术
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 11 篇 光学工程
- 11 篇 建筑学
- 7 篇 材料科学与工程（可...
- 6 篇 化学工程与技术
- 6 篇 网络空间安全
151 篇 理学
- 94 篇 数学
- 39 篇 物理学
- 25 篇 统计学（可授理学、...
- 24 篇 生物学
- 14 篇 化学
- 14 篇 地球物理学
- 7 篇 系统科学
58 篇 管理学
- 34 篇 图书情报与档案管...
- 28 篇 管理科学与工程(可...
- 7 篇 工商管理
33 篇 医学
- 29 篇 临床医学
16 篇 农学
8 篇 法学
- 7 篇 社会学
3 篇 经济学
1 篇 文学
1 篇 军事学

主题

356 篇 data visualizati...
211 篇 visualization
175 篇 rendering (compu...
116 篇 parallel process...
108 篇 graphics process...
96 篇 computational mo...
95 篇 computer graphic...
66 篇 hardware
52 篇 graphics
48 篇 graphics process...
48 篇 data models
43 篇 volume rendering
40 篇 computer science
40 篇 computer archite...
39 篇 parallel algorit...
39 篇 concurrent compu...
37 篇 application soft...
37 篇 data mining
37 篇 algorithm design...
37 篇 pipelines

机构

17 篇 argonne national...
13 篇 university of ca...
13 篇 argonne natl lab...
12 篇 ohio state univ ...
10 篇 university of ca...
10 篇 univ calif davis...
9 篇 los alamos natio...
9 篇 lawrence berkele...
9 篇 univ calif davis...
9 篇 univ utah sci in...
9 篇 oak ridge nation...
9 篇 sandia national ...
8 篇 lawrence livermo...
8 篇 oak ridge natl l...
8 篇 univ utah salt l...
8 篇 univ oregon euge...
7 篇 lawrence berkele...
7 篇 sandia natl labs...
7 篇 university of st...
7 篇 ohio state univ ...

作者

31 篇 ma kwan-liu
18 篇 kwan-liu ma
18 篇 childs hank
17 篇 shen han-wei
17 篇 pascucci valerio
14 篇 ahrens james
14 篇 bremer peer-timo
13 篇 han-wei shen
13 篇 huang jian
12 篇 michael e. papka
11 篇 peterka tom
11 篇 papka michael e.
10 篇 hank childs
10 篇 ertl thomas
10 篇 garth christoph
10 篇 joy kenneth i.
9 篇 james ahrens
9 篇 guo hanqi
9 篇 ma kl
9 篇 yu hongfeng

语言

1,196 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=IEEE Symposium on Parallel and Large-Data Visualization and Graphics"

共 1199 条记录，以下是1031-1040 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

visualization of directed associations in e-commerce transaction data

Visualization of directed associations in e-commerce transac...

引用

3rd Joint Eurographics - ieee TCVG symposium on visualization, VisSym 2001

作者： Hao, Ming C. Dayal, Umeshwar Hsu, Meichun Sprenger, Thomas Gross, Markus H. Hewlett Packard Research Laboratories Palo AltoCA United States

ISBN: (纸本)3211836748

Many real-world e-commerce applications require the mining of large volumes of transaction data to extract marketing and sales information. This paper describes the Directed Association visualization (DAV) system that visually associates product affinities and relationships for large volumes of e-commerce transaction data. DAV maps transaction data items and their relationships to vertices, edges, and positions on a visual spherical surface. DAV encompasses several innovative techniques (1) items are positioned according to their associations to show the strength of their relationships;(2) edges with arrows are used to represent the implication directions;(3) a mass-spring engine is integrated into a visual data mining platform to provide a self-organized graph. We have applied this system successfully to market basket analysis and e-customer profiling Internet applications. © 2001 Eurographics Association. All rights reserved.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Scalable interactive volume rendering using off-the-shelf components

Scalable interactive volume rendering using off-the-shelf co...

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： S. Lombeyda L. Moll M. Shand D. Breen A. Heirich California Institute of Technology USA Compaq Computer Corporation USA

Describes an application of a second generation implementation of the Sepia architecture (Sepia-2) to interactive volumetric visualization of large rectilinear scalar fields. By employing pipelined associative blending operators in a sort-last configuration a demonstration system with 8 rendering computers sustains 24 to 28 frames per second while interactively rendering large data volumes (1024/spl times/256/spl times/256 voxels, and 512/spl times/512/spl times/512 voxels). We believe interactive performance at these frame rates and data sizes is unprecedented. We also believe these results can be extended to other types of structured and unstructured grids and a variety of GL rendering techniques including surface rendering and shadow mapping. We show how to extend our single-stage crossbar demonstration system to multi-stage networks in order to support much larger data sizes and higher image resolutions. This requires solving a dynamic mapping problem for a class of blending operators that includes Porter-Duff compositing operators.

关键词： Computer displays Computer networks Concurrent computing Distributed computing Computer architecture Rendering (computer graphics) Application software Computer graphics Topology data visualization

来源：评论

学校读者我要写书评

暂无评论

parallel volume rendering on a single-chip SIMD architecture

Parallel volume rendering on a single-chip SIMD architecture

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： M. Meissner S. Grimm W. Strasser J. Packer D. Latimer WSI/GRIS University of Tübingen Tubingen Germany ClearSpeed Technology Limited Bristol UK

Volume rendering has great potential for parallelization due to the tremendous number of computations necessary. Besides the enormous computational power needed, the memory interface is usually of crucial importance and frequently the bottleneck. The paper presents an implementation of a parallel ray casting algorithm for orthogonal projections on a new single-chip SIMD architecture. Concurrent processing of rays is scheduled such that redundant memory accesses of the individual processing elements can be detected by the channel controller. Hence, data can be read efficiently in block-wise manner. For improved image quality, a permutation of the Shear-Warp algorithm with trilinear interpolation is used. The steps of the ray casting algorithm are carefully mapped onto the architecture avoiding expensive floating point operation, giving superior performance over previously reported results. A detailed analysis illustrates the timing of the individual computations and memory accesses, identifying the costliest parts of the implementation.

关键词： Rendering (computer graphics) Casting Memory architecture Computer architecture Interpolation Concurrent computing parallel programming Computer graphics parallel processing Real time systems

来源：评论

学校读者我要写书评

暂无评论

parallel view-dependent isosurface extraction using multi-pass occlusion culling

Parallel view-dependent isosurface extraction using multi-pa...

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： Jinzhu Gao Han-Wei Shen Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

Presents a parallel algorithm that can effectively extract only the visible portion of isosurfaces. The main focus of our research is to devise a load-balanced and output-sensitive algorithm, that is, each processor will generate approximately the same amount of triangles, and cells that do not contain the visible isosurface will not be visited. A multi-pass algorithm is proposed to achieve these goals. In the algorithm, we first use an octree data structure to rapidly skip the empty cells. An image space visibility culling technique is then used to identify the visible isosurface cells in a progressive manner. To distribute the workload, we use a binary image space partitioning method to ensure that each processor will generate approximately the same amount of triangles. Isosurface extraction and visibility update are performed in parallel to reduce the total computation time. In addition to reducing the size of output geometry and accelerating the process of isosurface extraction, the multi-pass nature of our algorithm can also be used to perform time-critical computation.

关键词： Isosurfaces data mining Concurrent computing Partitioning algorithms Acceleration Computer graphics Clustering algorithms data structures Hardware large-scale systems

来源：评论

学校读者我要写书评

暂无评论

A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids

A unified infrastructure for parallel out-of-core isosurface...

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： Yi-Jen Chiang R. Farias C.T. Silva Bin Wei Polytechnic University USA University of Stony Brook USA AT and T USA

We present a unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of large unstructured grids on distributed-memory parallel machines. We parallelize the out-of-core isosurface extraction algorithm of Chiang et al. (1998) and the out-of-core ZSweep technique (Farias and Silva, 2001) for direct volume rendering, using the meta-cell technique as a unified underlying building block. Our one-time preprocessing first partitions the dataset into meta-cells that are stored in disk. From the meta-cells, we build a BBIO tree in disk, which can be used to speed up isosurface extraction, and a bounding-box file in disk, which is used for direct volume rendering. At run-time, we use a simple self-scheduling scheme to achieve load balancing among the processors. We perform several experiments on a sixteen-node cluster of PCs connected by a gigabit Ethernet, using datasets as large as 6.6 million cells. For the larger datasets, we have found that both our isosurface extraction and direct volume rendering approaches are perfectly scalable up to sixteen nodes.

关键词： Isosurfaces data mining data visualization parallel machines Partitioning algorithms Concurrent computing Runtime Load management Personal communication networks Ethernet networks

来源：评论

学校读者我要写书评

暂无评论

Delaunay based shape reconstruction from large data

Delaunay based shape reconstruction from large data

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： T.K. Dey J. Giesen J. Hudson Ohio State Uinversity Columbus OH USA

ISBN: (纸本)0780372239

Surface reconstruction provides a powerful paradigm for modeling shapes from samples. For point cloud data with only geometric coordinates as input, Delaunay based surface reconstruction algorithms are shown to be quite effective both in theory and practice. However, a major complaint against Delaunay based methods is that they are slow and cannot handle large data. We extend the COCONE algorithm to handle supersize data. This is the first reported Delaunay based surface reconstruction algorithm that can handle data containing more than a million sample points on a modest machine.

关键词： Shape Surface reconstruction Solid modeling Reconstruction algorithms Mesh generation Robustness Hardware Clouds Computational geometry data visualization

来源：评论

学校读者我要写书评

暂无评论

parallel rendering with K-way replication

Parallel rendering with K-way replication

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： R. Samanta T. Funkhouser Kai Li Princeton University Princeton NJ USA

With the recent advances in commodity graphics hardware performance, PC clusters have become an attractive alternative to traditional high-end graphics workstations. The main challenge is to develop parallel rendering algorithms that work well within the memory constraints and communication limitations of a networked cluster. Previous systems have required the entire 3D scene to be replicated in memory on every PC. While this approach can take advantage of view-dependent load balancing algorithms and thus largely avoid the problems of inter-process communication, it limits the scalability of the system to the memory capacity of a single PC. We present a k-way replication approach in which each 3D primitive of a large scene is replicated on k out of n PCs (k/spl Lt/n). The key idea is to support 3D models larger than the memory capacity of any single PC, while retaining the reduced communication overheads of dynamic view-dependent partitioning. In this paper, we investigate algorithms for distributing copies of primitives among PCs and for dynamic load balancing under the constraints of partial replication. Our main result is that the parallel rendering efficiencies achieved with small replication factors are similar to the ones measured with full replication. By storing one-fourth of Michelangelo's David model (800 MB) on each of 24 PCs (each with 256 MB of memory), our system is able to render 40 million polygons/second (65 % efficiency).

关键词： Personal communication networks Rendering (computer graphics) graphics Clustering algorithms Layout Load management Hardware Workstations Memory management Scalability

来源：评论

学校读者我要写书评

暂无评论

Real-time out-of-core visualization of particle traces

Real-time out-of-core visualization of particle traces

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： R. Bruckschen F. Kuester B. Hamann K.I. Joy Visualization and Graphics Research Group Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis CA USA Visualization and Interactive Systems Group Department of Electrical and Computer Engineering University of California Irvine CA USA

ISBN: (纸本)0780372239

visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. The paper presents a method suitable for the real-time visualization of arbitrarily large time-varying vector fields in virtual environments. We describe an out-of-core scheme in which two distinct pre-processing and rendering components enable real-time data streaming and visualization. The presented approach yields low-latency application start-up times and small memory footprints. The described system was used to implement a "volumetric fog lance," which can emit up to 60000 particles into a flow field while maintaining an interactive frame rate of 60 frames per second. All algorithms were specifically designed to support commodity hardware. The proof-of-concept system is running on a low-cost Linux workstation equipped with a 120 GB E-IDE RAID (redundant array of inexpensive disk) system.

关键词： data visualization Computational modeling Computational fluid dynamics Motion pictures Hardware Computer graphics Interactive systems Image processing Computer science Image analysis

来源：评论

学校读者我要写书评

暂无评论

An application architecture for large data visualization: a case study 01

An application architecture for large data visualization: a ...

引用

Proceedings of the ieee 2001 symposium on parallel and large-data visualization and graphics

作者： C. Charles Law Amy Henderson James Ahrens Kitware Incorporated Los Alamos National Laboratory

ISBN: (纸本)9780780372238

In this case study we present an open-source visualization application with a data-parallel novel application architecture. The architecture is unique because is uses the Tcl scripting language to synchronize the user interface with the VTK parallel visualization pipeline and parallel-rendering module. The resulting application shows scalable performance, and is easily extendable because of its simple modular architecture. We demonstrate the application with a 9.8 gigabyte structured-grid ocean model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Case study: parallel Lagrangian visualization applied to natural convective flows

Case study: parallel Lagrangian visualization applied to nat...

引用

ieee symposium on parallel and large-data visualization and graphics (PVG)

作者： L.M. de la Cruz I. Garcia V. Godoy E. Ramos Dirección de Cómputo para la Investigación DGSCA Universidad Nacional Auténoma de México Mexico Centro de Investigación en Energía Universidad Nacional Auténoma de México Mexico

ISBN: (纸本)0780372239

Presents a visualization technique based on particle tracking. The technique consists in defining a set of points distributed on a closed surface and following the surface deformations as the velocity field changes in time. Deformations of the surface contain information about dynamics of the flow; in particular, it is possible to identify zones where flow stretching and foldings occur. Because the points on the surface are independent of each other, it is possible to calculate the trajectory of each point concurrently. Two parallel algorithms are studied; the first one for a shared memory Origin 2000 supercomputer and the second one for a distributed memory PC cluster. The technique is applied to a fluid moving by natural convection inside a cubic container.

关键词： Computer aided software engineering Lagrangian functions visualization Particle tracking Aerodynamics Computational fluid dynamics parallel algorithms parallel programming Equations Supercomputers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共120页 << < 100 101 102 103 104 105 106 107 108 109 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：