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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1111-1120 订阅

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

详细简洁

排序：

Semi-automatic generation of transfer functions for direct volume rendering

Semi-automatic generation of transfer functions for direct v...

引用

ieee symposium on Volume visualization and graphics

作者： G. Kindlmann J.W. Durkin Program of Computer Graphics Cornell University Salt Lake UT USA Program of Computer Graphics Cornell University Ithaca NY USA

Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering process makes generating an informative rendering challenging. In particular, the specification of the transfer function-the mapping from data values to renderable optical properties-is frequently a time consuming and unintuitive task. Ideally, the data being visualized should itself suggest an appropriate transfer function that brings out the features of interest without obscuring them with elements of little importance. We demonstrate that this is possible for a large class of scalar volume data, namely that where the regions of interest are the boundaries between different materials. A transfer function which makes boundaries readily visible can be generated from the relationship between three quantities: the data value and its first and second directional derivatives along the gradient direction. A data structure we term the histogram volume captures the relationship between these quantities throughout the volume in a position independent, computationally efficient fashion. We describe the theoretical importance of the quantities measured by the histogram volume, the implementation issues in its calculation, and a method for semiautomatic transfer function generation through its analysis. We conclude with results of the method on both idealized synthetic data as well as real world datasets.

关键词： Transfer functions data visualization Histograms Size control Process control Power generation data structures Volume measurement

来源：评论

学校读者我要写书评

暂无评论

引用

ieee symposium on Information visualization (INFOVIS)

作者： M. Ankerst S. Berchtold D.A. Keim University of Munich (LMU) Munich Germany AT and T Bell Laboratories Inc. Florham Park NJ USA Martin Luther University of Halle-Wittenberg Halle Germany

The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recursive pattern, and many others. We describe a systematic approach to arrange the dimensions according to their similarity. The basic idea is to rearrange the data dimensions such that dimensions showing a similar behavior are positioned next to each other. For the similarity clustering of dimensions, we need to define similarity measures which determine the partial or global similarity of dimensions. We then consider the problem of finding an optimal one- or two-dimensional arrangement of the dimensions based on their similarity. Theoretical considerations show that both, the one- and the two-dimensional arrangement problem are surprisingly hard problems, i.e. they are NP complete. Our solution of the problem is therefore based on heuristic algorithms. An empirical evaluation using a number of different visualization techniques shows the high impact of our similarity clustering of dimensions on the visualization results.

关键词： data visualization Multidimensional systems Laboratories Shape Humans Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

parallel rendering techniques for massively parallel visualization

Parallel rendering techniques for massively parallel visuali...

引用

2nd AIZU International symposium on parallel Algorithms/Architecture Synthesis

作者： Hansen, C Krogh, M Painter, J Los Alamos Natl Lab Los Alamos United States

ISBN: (纸本)0818678704

As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of Massively parallel Processors (MPPs) are becoming increasingly important. For large applications rendering on the MPP tends to be preferable to rendering on a graphics workstation due to the MPP's abundant resources: memory, disk, and numerous processors. The challenge becomes developing algorithms that carl exploit these resources while minimizing overhead, typically communication costs. This paper will describe recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume render use a MIMD approach. Implementations for these algorithms are presented far the Thinking Machines Corporation CM-5 and the Cray Research Inc T3D.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Maintaining dynamic geometric objects on parallel processors 97

Maintaining dynamic geometric objects on parallel processors

引用

ieee 3rd parallel Rendering symposium (PRS 97) / ieee visualization 97

作者： Garmann, R Informatik VII Universität Dortmund

ISBN: (纸本)1581130104

parallelizing dynamic scientific applications involves solving the dynamic load balancing problem. The balancing should take the communication requirements of the application into account. Especially in the field of computer graphics many problems are dealing with objects in k-dimensional space with very special communication patterns. We describe a load balancing strategy based on a geometric clustering of objects with provable good performance, that is well suited to applications with interdependencies between neighbouring objects or between objects that have al least one coordinate in common.

关键词： dynamic load balancing parallel scientific computing distributed data structures rendering application geometric objects clustering locality orthogonal communication pattern

来源：评论

学校读者我要写书评

暂无评论

Research report - Volume rendering for relational data

Research report - Volume rendering for relational data

引用

ieee symposium on Information visualization (InfoVis 97)

作者： Becker, BG Silicon Graphics Inc Mountain View United States

ISBN: (纸本)0818681896

A method for efficiently volume rendering dense scatterplots of relational data is described. Plotting difficulties that arise from large numbers of data points, categorical variables, interaction with non-axis dimensions, and unknown values, are addressed by this method. The domain of the plot is voxelized using binning and then volume rendered. Since a table is used as the underlying data structure, no storage is wasted on regions with no data. The opacity of each voxel is a function of the number of data points in a corresponding bin. A voxel's color is derived by averaging the value of one of the variables for all the data points that fall in a bin. Other variables in the data may be mapped to external query sliders. A dragger object permits a user to select regions inside the volume.

关键词： volume rendering relational data scatterplot multivariate data information visualization

来源：评论

学校读者我要写书评

暂无评论

ParVox - a parallel splatting volume rendering system for distributed visualization

ParVox - a parallel splatting volume rendering system for di...

引用

Proceedings of the 1997 ieee symposium on parallel Rendering, PRS

作者： Li, P.Peggy Whitman, Scott Mendoza, Roberto Tsiao, James Jet Propulsion Lab Pasadena United States

This paper presents a parallel volume rendering system, ParVox, for large volumes of 4-D data sets in regular structured grids. A parallel volume rendering API based on the splatting algorithm constitutes the core of the ParVox system. A network interface program takes commands from an X Window based GUI, calls the API to perform the rendering functions, compresses the rendered images and sends them back to the GUI window. The ParVox system is designed for interactive, distributed visualization of large multiple time steps, multiple parameters volume datasets. The parallel splatting algorithm employs both object space decomposition and image space decomposition;an asynchronous image compositing scheme based on the direct send model reduces both the communication overhead and the synchronization overhead. The ParVox system architecture, the parallel algorithm and its implementation on the Cray T3D and the parallel wavelet compression algorithm are discussed extensively in this paper. The performance results and some optimization techniques are also presented.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel rendering techniques for massively parallel visualization

Parallel rendering techniques for massively parallel visuali...

引用

Aizu International symposium on parallel Algorithms/Architecture Synthesis

作者： C. Hansen M. Krogh J. Painter Advanced Computing Laboratory Los Alamos National Laboratory Los Alamos NM USA

As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of massively parallel processors (MPPs) are becoming increasingly important. For large applications, rendering on an MPP tends to be preferable to rendering on a graphics workstation, due to the MPP's abundant resources: memory, disk and numerous processors. The challenge is developing algorithms that can exploit these resources while minimizing overheads, typically communication costs. This paper describes recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. It presents rendering algorithms, developed for MPPs, for polygonal, spherical and volumetric data. The polygon algorithm uses a data-parallel approach, whereas the sphere and volume rendering use a MIMD approach. Implementations for these algorithms are presented for a Thinking Machines Corp. CM-5 and a Cray Research Inc. T3D.

关键词： visualization Rendering (computer graphics) Geometry Concurrent computing Laboratories parallel processing graphics Costs Computational modeling Vector processors

来源：评论

学校读者我要写书评

暂无评论

Volume rendering for relational data

Volume rendering for relational data

引用

ieee symposium on Information visualization (INFOVIS)

作者： B.G. Becker Silicon Graphics Inc. Mountain View CA USA

A method for efficiently volume rendering dense scatterplots of relational data is described. Plotting difficulties that arise from large numbers of data points, categorical variables, interaction with non-axis dimensions, and unknown values, are addressed by this method. The domain of the plot is voxelized using binning and then volume rendering. Since a table is used as the underlying data structure, no storage is wasted on regions with no data. The opacity of each voxel is a function of the number of data points in a corresponding bin. A voxel's color is derived by averaging the value of one of the variables for all the data points that fall in a bin. Other variables in the data may be mapped to external query sliders. A dragger object permits a user to select regions inside the volume.

关键词： Scattering data visualization Rendering (computer graphics) Relational databases data structures Silicon graphics Stacking data compression Shape

来源：评论

学校读者我要写书评

暂无评论

Managing multiple focal levels in Table Lens

Managing multiple focal levels in Table Lens

引用

ieee symposium on Information visualization (INFOVIS)

作者： T. Tenev R. Rao Xerox Palo Alto Research Center Inxight Software Inc. Palo Alto CA USA

The Table Lens, focus+context visualization for large data tables, allows users to see 100 times as many data values as a spreadsheet in the same screen space in a manner that enables an extremely immediate form of exploratory data analysis. In the original Table Lens design, data are shown in the context area using graphical representations in a single pixel row. Scaling up the Table Lens technique beyond approximately 500 cases (rows) by 40 variables (columns) requires not showing every value individually and thus raises challenges for preserving the exploratory and navigational ease and power of the original design. We describe two design enhancements for introducing regions of less than a pixel row for each data value and discuss the issues raised by each.

关键词： Lenses Optical design Navigation data visualization data analysis Displays Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

ParVox-a parallel splatting volume rendering system for distributed visualization 97

ParVox-a parallel splatting volume rendering system for dist...

引用

parallel Rendering symposium

作者： P.P. Li S. Whitman R. Mendoza J. Tsiao Jet Propulsion Laboratory USA Equator Technologies Inc.

ISBN: (纸本)9781581130102

The paper presents a parallel volume rendering system, ParVox, for large volumes of 4D data sets in regular structured grids. A parallel volume rendering API based on the splatting algorithm constitutes the core of the ParVox system. A network interface program takes commands from an X Window based GUI, calls the API to perform the rendering functions, compresses the rendered images and sends them back to the GUI window. The ParVox system is designed for interactive, distributed visualization of large multiple time steps, multiple parameters volume datasets. The parallel splatting algorithm employs both object space decomposition and image space decomposition; an asynchronous image compositing scheme based on the direct send model reduces both the communication overhead and the synchronization overhead. The ParVox system architecture, the parallel algorithm and its implementation on the Cray T3D and the parallel wavelet compression algorithm are discussed extensively. The performance results and some optimization techniques are also presented.

关键词： Rendering (computer graphics) data visualization Partitioning algorithms Shearing Propulsion Laboratories Casting Round robin Image analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共120页 << < 108 109 110 111 112 113 114 115 116 117 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：