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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

351 篇 会议
24 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

188 篇 工学
- 144 篇 计算机科学与技术...
- 139 篇 软件工程
- 31 篇 电气工程
- 10 篇 机械工程
- 9 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 建筑学
- 6 篇 土木工程
- 6 篇 生物医学工程（可授...
- 5 篇 光学工程
- 4 篇 测绘科学与技术
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 控制科学与工程
- 3 篇 化学工程与技术
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
44 篇 理学
- 33 篇 数学
- 13 篇 物理学
- 7 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 化学
- 3 篇 地球物理学
18 篇 管理学
- 10 篇 图书情报与档案管...
- 8 篇 管理科学与工程(可...
- 3 篇 工商管理
8 篇 医学
- 6 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 农学
2 篇 法学
1 篇 军事学

主题

90 篇 data visualizati...
87 篇 rendering (compu...
81 篇 visualization
45 篇 computer graphic...
38 篇 computational mo...
38 篇 graphics process...
37 篇 hardware
32 篇 parallel process...
31 篇 graphics
25 篇 concurrent compu...
22 篇 graphics process...
19 篇 ray tracing
17 篇 application soft...
17 篇 computer archite...
16 篇 parallel renderi...
14 篇 algorithm design...
14 篇 pipelines
14 篇 layout
13 篇 laboratories
13 篇 volume rendering

机构

6 篇 university of ca...
6 篇 sandia national ...
5 篇 argonne national...
5 篇 oak ridge natl l...
4 篇 sandia natl labs...
4 篇 los alamos natio...
4 篇 argonne natl lab...
4 篇 argonne national...
3 篇 university of ca...
3 篇 nvidia corporati...
3 篇 department of co...
3 篇 department of ph...
3 篇 univ utah salt l...
3 篇 univ calif davis...
3 篇 beckman institut...
2 篇 univ new hampshi...
2 篇 univ erlangen nu...
2 篇 inria alice grp ...
2 篇 ohio state uinve...
2 篇 vrvis res ctr a-...

作者

9 篇 ma kwan-liu
8 篇 kwan-liu ma
6 篇 papka michael e.
6 篇 childs hank
5 篇 han-wei shen
5 篇 ma kl
5 篇 ahrens james
4 篇 vishwanath venka...
4 篇 venkatram vishwa...
4 篇 michael e. papka
4 篇 mark hereld
4 篇 moreland kenneth
4 篇 pascucci valerio
4 篇 lum eb
4 篇 hereld mark
4 篇 insley joseph
3 篇 kenneth moreland
3 篇 james ahrens
3 篇 camp david
3 篇 m. meissner

语言

376 篇 英文

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

共 376 条记录，以下是321-330 订阅

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

详细简洁

排序：

On the partitionability of hierarchical radiosity

On the partitionability of hierarchical radiosity

引用

ieee parallel visualization and graphics symposium

作者： R. Garmann FB Informatik Universität Dortmund Germany

The hierarchical radiosity algorithm (HRA) is one of the most efficient sequential algorithms for physically based rendering. Unfortunately, it is hard to implement in parallel. There exist fairly efficient shared-memory implementations but things get worse in a distributed memory (DM) environment. We examine the structure of the HRA in a graph partitioning setting. Various measurements performed on the task access graph of the HRA indicate the existence of several bottlenecks in a potential DM implementation. We compare "optimal" partitioning results obtained by the partitioning software Metis with a trivial and a spatial partitioning algorithm, and show that the spatial partitioning copes with most of the bottlenecks well.

关键词： Partitioning algorithms Delta modulation Software algorithms Performance evaluation Computational modeling Concurrent computing parallel algorithms Load management Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

parallel visualization of large-scale aerodynamics calculations: a case study on the Cray T3E

Parallel visualization of large-scale aerodynamics calculati...

引用

ieee parallel visualization and graphics symposium

作者： Kwan-Liu Ma T.W. Crockett University of California Davis USA Institute of Computer Applications in Science and Engineering USA

ISBN: (纸本)0780359011

This paper reports the performance of a parallel volume rendering algorithm for visualizing a large-scale unstructured-grid dataset produced by a three-dimensional aerodynamics simulation. This dataset, containing over 18 million tetrahedra, allows us to extend our performance results to a problem which is more than 30 times larger than the one we examined previously. This high resolution dataset also allows us to see fine, three-dimensional features in the flow field. All our tests were performed on the SGI/Cray T3E operated by NASA's Goddard Space Flight Center. Using 511 processors, a rendering rate of almost 9 million tetrahedra/second was achieved with a parallel overhead of 26%.

关键词： Large-scale systems Aerodynamics Computer aided software engineering Rendering (computer graphics) Testing parallel programming Concurrent computing Data visualization Computer graphics Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Exploiting frame coherence with the temporal depth buffer in a distributed computing environment

Exploiting frame coherence with the temporal depth buffer in...

引用

ieee parallel visualization and graphics symposium

作者： T.A. Davis E.W. Davis Clemson University USA North Carolina State University USA

We introduce the notion of a parallel temporal depth buffer (or t-buffer) to speed up the rendering process for ray traced animations. The t-buffer is a conceptually simple data structure which stores knowledge about coherent pixel values across the duration of an animation. Through the use of this information, we can potentially avoid recomputing a significant number of redundant pixel values and thus substantially reduce overall computing time. Although the t-buffer is general enough to be used with a variety of rendering methods, the algorithm employed in this work targets ray-traced animations and therefore readily lends itself to parallelization. A clustered (or distributed) computing environment is an efficient and effective candidate to handle the parallel computation due to its relatively low cost and the high computation to communication ratio inherent in the processing. The results from this method show substantial reductions in computation and overall rendering time with relatively low overhead.

关键词： Distributed computing Animation Rendering (computer graphics) parallel processing Ray tracing Pixel Computational efficiency Cameras Data structures parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Transparent distributed processing for rendering

Transparent distributed processing for rendering

引用

ieee parallel visualization and graphics symposium

作者： P. Kipfer P. Slusallek Computer Graphics Group University of Erlangen Germany Computer Graphics Group University of Stanford USA

Rendering, in particular the computation of global illumination, uses computationally very demanding algorithms. As a consequence many researchers have looked into speeding up the computation by distributing it over a number of computational units. However, in almost all cases did they completely redesign the relevant algorithms in order to achieve high efficiency for the particular distributed or parallel environment. At the same time global illumination algorithms have become more and more sophisticated and complex. Often several basic algorithms are combined in multi-pass arrangements to achieve the desired lighting effects. As a result, it is becoming increasingly difficult to analyze and adapt the algorithms for optimal parallel execution at the lower levels. Furthermore, these bottom-up approaches destroy the basic design of an algorithm by polluting it with distribution logic and thus easily making it unmaintainable. We present a top-down approach for designing distributed applications based on their existing object-oriented decomposition. Distribution logic, in our case based on the CORBA middleware standard, is introduced transparently to the existing application logic. The design approach is demonstrated using several examples of multi-pass global illumination computation and ray tracing. The results show that a good speedup can usually be obtained even with minimal intervention into existing applications.

关键词： Distributed processing Application software Computer graphics Lighting Algorithm design and analysis Programming profession Distributed computing Logic Object oriented programming parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel lumigraph reconstruction

Parallel lumigraph reconstruction

引用

ieee parallel visualization and graphics symposium

作者： P.-P. Sloan C. Hansen Microsoft Research Limited Redmond WA USA Department of Computer Science University of Utah Salt Lake UT USA

ISBN: (纸本)0780359011

Presents three techniques for reconstructing lumigraphs/lightfields on commercial ccNUMA parallel distributed shared memory computers. The first method is a parallel extension of the software-based lightfield method proposed by M. Levoy and P. Hanrahan (1996). This expands the ray/two-plane intersection test along the film plane, which effectively becomes scan conversion. The second method extends this idea by using a shear/warp factorization that accelerates rendering. The third technique runs on an SGI Reality Monster using up to eight graphics pipes and texture mapping hardware to reconstruct images. We characterize the memory access patterns exhibited using the hardware-based method and use this information to reconstruct images from a tiled UV plane. We describe a method to use quad-cubic reconstruction kernels. We analyze the memory access patterns that occur when viewing lumigraphs. This allows us to ascertain the cost/benefit ratio of various tilings of the texture plane.

关键词： Image reconstruction Concurrent computing Distributed computing Testing Image converters Acceleration Rendering (computer graphics) graphics Hardware Kernel

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Real-time maximum intensity projection

Real-time maximum intensity projection

引用

1st Joint Eurographics - ieee TCVG symposium on visualization, VisSym 1999

作者： Mroz, Lukas König, Andreas Gröller, Eduard Vienna University of Technology Institute of Computer Graphics Karlsplatz 13/186/2 ViennaA-1040 Austria

ISBN: (纸本)9783709168035

Maximum Intensity Projection (MIP) is a volume rendering technique which is used to extract high-intensity structures from volumetric data. At each pixel the highest data value encountered along the corresponding viewing ray is determined. MIP is commonly used to extract vascular structures from medical MRI data sets (angiography). The usual way to compensate for the loss of spatial and occlusion information in MIP images is to view the data from different view points by rotating them. As the generation of MIP is usually non-interactive, this is done by calculating multiple images offline and playing them back as an animation. In this paper a new algorithm is proposed which is capable of interactively generating Maximum Intensity Projection images using parallel projection and templates. Voxels of the data set which will never contribute to a MIP due to their neighborhood are removed during a preprocessing step. The remaining voxels are stored in a way which guarantees optimal cache coherency regardless of the viewing direction. For use on low-end hardware, a preview-mode is included which renders only more significant parts of the volume during user interaction. Furthermore we demonstrate the usability of our data structure for extensions of the MIP technique like MIP with depth-shading and Local Maximum Intensity Projection (LMIP). © 1999 Eurographics Association. All rights reserved.

关键词： Angiography

来源：评论

学校读者我要写书评

暂无评论

A memory addressing and access design for real time volume rendering

A memory addressing and access design for real time volume r...

引用

ieee International symposium on Circuits and Systems (ISCAS)

作者： M. Doggett M. Meissner WSI/GRIS University of Tübingen Germany

This paper presents a memory addressing design that uses buffering to achieve a cache hit ratio of 95% for a PCI based Volume Rendering hardware accelerator. The target system for this memory interface is VIZARD II, a second generation PCI board using several XILINX chips. To improve the performance of this and possibly other hardware accelerators, a cubic addressing scheme is presented that improves the percentage of cache hits to misses. To further improve the performance the cubic addressing is coupled with several FIFO buffers to minimise the pipeline stalling effect of cache misses in the eight parallel memory modules. This combination of addressing scheme and memory access buffering raises the cache hit to miss ratio from 63% to 95%. Most Volume Rendering systems are fully pipelined and can utilise the design presented here to increase the number of frames per second and the quality of rendered images.

关键词： Rendering (computer graphics) Casting Hardware Random access memory Computer graphics Biomedical imaging Real time systems Image generation Pipelines Data visualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：