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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

371 篇 会议
17 篇 期刊文献

馆藏范围

388 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

202 篇 工学
- 171 篇 计算机科学与技术...
- 146 篇 软件工程
- 34 篇 电气工程
- 18 篇 信息与通信工程
- 7 篇 机械工程
- 7 篇 电子科学与技术（可...
- 7 篇 建筑学
- 6 篇 控制科学与工程
- 6 篇 土木工程
- 5 篇 测绘科学与技术
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 4 篇 网络空间安全
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
50 篇 理学
- 39 篇 数学
- 10 篇 物理学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
- 5 篇 生物学
- 3 篇 地球物理学
- 2 篇 系统科学
27 篇 管理学
- 15 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
6 篇 医学
- 6 篇 临床医学
3 篇 农学
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
1 篇 军事学

主题

113 篇 data visualizati...
68 篇 rendering (compu...
63 篇 visualization
37 篇 computer graphic...
34 篇 parallel process...
28 篇 computational mo...
25 篇 hardware
23 篇 concurrent compu...
22 篇 laboratories
22 篇 graphics
21 篇 computer science
21 篇 application soft...
18 篇 ray tracing
17 篇 graphics process...
16 篇 parallel renderi...
16 篇 data mining
15 篇 parallel algorit...
14 篇 volume rendering
13 篇 large-scale syst...
12 篇 testing

机构

6 篇 university of ca...
6 篇 sandia national ...
5 篇 oak ridge natl l...
5 篇 univ calif davis...
4 篇 sandia natl labs...
4 篇 argonne natl lab...
4 篇 argonne national...
4 篇 univ utah salt l...
4 篇 argonne national...
3 篇 university of ca...
3 篇 los alamos natio...
3 篇 univ tennessee k...
2 篇 inria alice grp ...
2 篇 hewlett packard ...
2 篇 vrvis res ctr a-...
2 篇 university of ca...
2 篇 kitware inc.
2 篇 albuquerque high...
2 篇 lawrence berkele...
2 篇 sandia national ...

作者

10 篇 ma kwan-liu
7 篇 kwan-liu ma
7 篇 ma kl
6 篇 papka michael e.
6 篇 childs hank
5 篇 ahrens james
4 篇 vishwanath venka...
4 篇 venkatram vishwa...
4 篇 michael e. papka
4 篇 mark hereld
4 篇 huang jian
4 篇 moreland kenneth
4 篇 lum eb
4 篇 hereld mark
4 篇 insley joseph
3 篇 kenneth moreland
3 篇 dayal u
3 篇 camp david
3 篇 bendix f
3 篇 w. strasser

语言

388 篇 英文

检索条件"任意字段=Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics"

共 388 条记录，以下是341-350 订阅

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

详细简洁

排序：

Dynamic view-dependent partitioning of structured grids with complex boundaries for object-order rendering techniques

Dynamic view-dependent partitioning of structured grids with...

引用

ieee parallel visualization and graphics symposium

作者： L.C. Burton R. Machiraju D.S. Reese NSF Engineering Research Center Department of Computer Science Mississippi State University USA

Object-order rendering techniques present an attractive approach to run-time visualization of structured grid data, particularly when combined with a parallel rendering paradigm such as image composition. The ability of this combination to exploit hardware exceeds that of parallel image order methods. However, certain configurations of grid boundaries prevent composition from being performed correctly. In particular when the boundary between two partitions contains concave sections, the partitions may no longer be depth sorted correctly, a requirement for some visualization techniques such as direct volume rendering. This occurs because the concave boundary prevents even the simple ordering of two adjacent partitions. If the data may be repartitioned such that it can be depth sorted correctly then an image composition approach is a viable option. To facilitate such an operation, we present an algorithm to analyze the geometric structure of a grid boundary and extract knowledge about how the boundary impacts depth sorting and therefore image composition. We then show through examples how this knowledge may be applied to create a set of partitions that may be properly depth sorted.

关键词： data visualization Partitioning algorithms Physics computing data engineering Geometry Computer science Runtime Image analysis Algorithm design and analysis data mining

来源：评论

学校读者我要写书评

暂无评论

Interactive volume segmentation with the PAVLOV architecture

Interactive volume segmentation with the PAVLOV architecture

引用

ieee parallel visualization and graphics symposium

作者： K. Kreeger A. Kaufman Center for Visual Computing (CVC) and Department of Computer Science State University of New York Stony Brook NY USA

We propose a new paradigm for interactive volume visualization which allows enhanced exploration of datasets through the use of real-time volume processing (e.g., segmentation) tightly coupled with rendering. We show examples of how this paradigm supports a new way of examining a dataset by providing interactive visual feedback to segmentation parameter adjustment. We have developed a hardware co-processor, called PAVLOV, based on a SIMD mesh architecture. It supports our paradigm by providing volume processing at over 15 Hz while also rendering of the results at 30 Hz. We show how PAVLOV's programmability is used for volume processing applications, such as interactive segmentation and feature extraction. We further compare 3D segmentation on mesh architectures to known efficient methods for 2D segmentation.

关键词： visualization Feature extraction Frequency Computer architecture Computer science Feedback Coprocessors Personal communication networks data engineering Volume measurement

来源：评论

学校读者我要写书评

暂无评论

A superscalar 3D graphics engine

A superscalar 3D graphics engine

引用

ieee/ACM International symposium on Microarchitecture (MICRO)

作者： A. Wolfe D.B. Noonburg S3 Incorporated Santa Clara CA USA

3D graphics performance is increasing faster than any other computing application. Almost all PC systems now include 3D graphics accelerators for games, CAD, or visualization applications. Many of the microarchitectural techniques that have been used to enhance the performance of microprocessors can be applied to graphics systems as well. We present an architecture for an out-of-order, superscalar rasterizer for 3D graphics. This allows the concurrent execution of multiple graphics primitives while maintaining exact sequential semantics. Experimental results show 1.5-3.6X speedups on real applications using a simple model, similar to the results from many integer benchmarks on superscalar processors. Enhanced techniques specific to 3D graphics for decomposing large triangles and breaking false dependence chains increase performance to more than 10x a sequential system.

关键词： Engines Microprocessors Application software Microarchitecture parallel processing Rendering (computer graphics) Computer applications visualization Computer graphics Computer interfaces

来源：评论

学校读者我要写书评

暂无评论

Reducing data Distribution Bottlenecks by Employing data visualization Filters 99

Reducing Data Distribution Bottlenecks by Employing Data Vis...

引用

proceedings of the 8th ieee International symposium on High Performance Distributed Computing

作者： Ernest Franke Michael Magee

ISBN: (纸本)9780769502878

Between 1994 and 1997, researchers at Southwest Research Institute (SwRI) investigated methods for distributing parallel computation and data visualization under the support of an internally funded Research Initiative Program entitled the Advanced visualization Technology Project (AVTP). A hierarchical data cache architecture was developed to provide a flexible interface between the modeling or simulation computational processes and data visualization programs. Compared to conventional post facto data visualization approaches, this data cache structure provides many advantages including simultaneous data access by multiple visualization clients, comparison of experimental and simulated data, and visual analysis of computer simulation as computation proceeds. However, since the data cache was resident on a single workstation, this approach did not address the issue of scalability of methods for avoiding the data storage bottleneck by distributing the data across multiple networked workstations. Scalability through distributed database approaches is being investigated as part of the Applied visualization using Advanced Network Technology Infrastructure (AVANTI) *** paper describes a methodology currently under development that is intended to avoid bottlenecks that typically arise as the result of data consumers (e.g. visualization applications) that must access and process large amounts of data that has been generated and resides on other hosts, and which must pass through a central data cache prior to being used by the data consumer. The methodology is based on a fundamental paradigm that the end result (visualization) rendered by a data consumer can, in many cases, be produced using a reduced data set that has been distilled or filtered from the original data set. In the most basic case, the filtered data used as input to the data consumer may simply be a proper subset of massive data sets that have been distributed among hosts. For the general case, howeve

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel performance visualization using moments of utilization data 1

Parallel performance visualization using moments of utilizat...

引用

1st Merged International parallel Processing symposium/symposium on parallel and Distributed Processing (IPPS/SPDP 1998)

作者： Godin, TJ Quinn, MJ Pancake, CM Oregon State Univ Dept Comp Sci Corvallis OR 97331 USA

ISBN: (纸本)0818684038

We propose a new parallel performance visualization scheme, based on a simple moment analysis of processor utilization data. This method combines the scalability advantages of statistical summaries with the more revealing processor utilization information of Gantt charts. it scales well to large numbers of processors, requiring only storage constant in execution time.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Using PVM and MPI for co-processed, distributed and parallel scientific visualization 12th

引用

10 Workshops held in conjunction with 12th International parallel symposium and 9th symposium on parallel and Distributed Processing, IPPS/SPDP 1998

作者： Haimes, Robert Jordan, Kirk E. Department of Aeronautics and Astronautics Massachusetts Institute of Technology United States IBM Corporation 404 Wyman Street WalthamMA02254 United States

ISBN: (纸本)3540643591

This paper discusses the combined use of MPI and PVM in the parallel visualization tool kit, pV3. The implementation provides for efficient co-processed, distributed parallel visualization of large-scale 3D time dependent simulations. The primary goals of pV3 include the ability;to handle large-scale transient 3D simulations, to take full advantage of available hardware encompassing both parallel compute engines and graphics workstations, to visualize the data as the computation progresses, to interact and interrogate the data as its computed, and to steer the simulation by adjusting parameters obtaining immediate feedback from the changes. Based on a client/server model, the original implementation of pV3 was founded on PVM. The client portion executes coupled closely with the application code and ‘extracts’ from the distributed data volume, in place, lower dimensional data. The distilled data is transferred to the interactive server portion of pV3 (executing on a graphics workstation) where the rendering and display are performed. This unique architecture frees up the compute engine(s) from dealing with the graphics, and reduces the large data-set to a size that can be rapidly transported to the server using standard network connections. There are some drawbacks in using PVM on parallel machines which stem from TCP/IP communications. These include, in some instances, not taking full advantage of the hardware interconnect on the machine as communication must occur with the graphics workstation. This can result in smaller messages and increased latency. In addition, pV3’s dynamic attachment required that the graphics workstation be accessible from each node on the machine with PVM's ‘group’ functionality intact, which poses a problem on some parallel systems. The pV3 ‘concentrator’ module was designed to overcome such problems on distributed memory platforms. All pV3 messages on the parallel machine use the high-speed interconnect via the MPI protocol. Communication

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

引用

proceedings of the 1998 ieee symposium on Information visualization

作者： Ankerst, Mihael Berchtold, Stefan Keim, Daniel A. Univ of Munich Munich Germany

The order and arrangement of dimensions (variates) in crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recursive pattern, and many others. In this paper, 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.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 1998 ieee symposium on Volume visualization, VVS 1998

Proceedings of the 1998 IEEE Symposium on Volume Visualizati...

引用

1998 ieee symposium on Volume visualization, VVS 1998

ISBN: (纸本)1581131054

The proceedings contain 18 papers. The topics discussed include: coloring voxel-based objects for virtual endoscopy;probabilistic segmentation of volume data for visualization using SOM-PNN classifier;semi-automatic generation of transfer functions for direct volume rendering;adaptive perspective ray casting;a real-time volume rendering architecture using an adaptive resampling scheme for parallel and perspective projections;an exact interactive time visibility ordering algorithm for polyhedral cell complexes;volume animation using the skeleton tree;3D scan conversion of CSG models into distance volumes;adding shadows to a texture-based volume renderer;edge presentation in volume rendering using splatting;using distance maps for accurate surface representation in sampled volumes;wavelet based adaptive interpolation for volume rendering;object voxelization by filtering;an accurate method for voxelizing polygon meshes;extracting ISO-valued features in 4-dimensional scalar fields;and opaci@-weighted color interpolation for volume sampling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：