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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

OpenGL multipipe SDK: A toolkit for scalable parallel rendering

OpenGL multipipe SDK: A toolkit for scalable parallel render...

引用

VIS 05: ieee visualization 2005, Proceedings

作者： Bhaniramka, Praveen Robert, Philippe C. D. Eilemann, Stefan Silicon Graphics Inc. University of Bern Switzerland University of Zurich Switzerland

ISBN: (纸本)0780394623

We describe OpenGL Multipipe SDK (MPK), a toolkit for scalable parallel rendering based on OpenGL. MPK provides a uniform application programming interface (API) to manage scalable graphics applications across many different graphics subsystems. MPK-based applications run seamlessly from single-processor, single-pipe desktop systems to large multi-processor, multipipe scalable graphics systems. The application is oblivious of the system configuration, which can be specified through a configuration file at run time. To scale application performance, MPK uses a decomposition system that supports different modes for task partitioning and implements optimized GPU-based composition algorithms. MPK also provides a customizable image composition interface, which can be used to apply post-processing algorithms on raw pixel data obtained from executing sub-tasks on multiple graphics pipes in parallel. This can be used to implement parallel versions of any GPU-based algorithm, not necessarily used for rendering. In this paper, we motivate the need for a scalable graphics API and discuss the architecture of MPK. We present MPK's graphics configuration interface, introduce the notion of compound-based decomposition schemes and describe our implementation. We present some results from our work on a couple of target system architectures and conclude with future directions of research in this area. © 2005 ieee.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

7th Joint Eurographics - ieee VGTC symposium on visualization, VisSym 2005

7th Joint Eurographics - IEEE VGTC Symposium on Visualizatio...

引用

7th Joint Eurographics - ieee VGTC symposium on visualization, VisSym 2005

ISBN: (纸本)3905673193

The proceedings contain 38 papers. The topics discussed include: dynamically modelling interaction;real-time advection and volumetric illumination for the visualization of 3D unsteady flow;dense geometric flow visualization;vector field analysis and visualization through variational clustering;scalable, robust visualization of very large trees;the i-Disc - a tool to visualize and explore topic maps;ArcTrees: visualizing relations in hierarchical data;tiled parallel coordinates for the visualization of time-varying multichannel EEG data;illustrative context-preserving volume rendering;high quality rendering of compressed volume data formats;and BioBrowser: a framework for fast protein visualization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DuoDecim: A structure for point scan compression and rendering

DuoDecim: A structure for point scan compression and renderi...

引用

Eurographics/ieee VGTC symposium on Point-Based graphics, 2005

作者： Krüger, Jens Schneider, Jens Westermann, Rüdiger Computer Graphics and Visualization Group Technical University Munich Germany

ISBN: (纸本)3905673207

In this paper we present a compression scheme for large point scans including per-point normals. For the encoding of such scans we introduce a particular type of closest sphere packing grids, the hexagonal close packing (HCP). HCP grids provide a structure for an optimal packing of 3D space, and for a given sampling error they result in a minimal number of cells if geometry is sampled into these grids. To compress the data, we extract linear sequences (runs) of filled cells in HCP grids. The problem of determining optimal runs is turned into a graph theoretical one. Point positions and normals in these runs are incrementally encoded. At a grid spacing close to the point sampling distance, the compression scheme only requires slightly more than 3 bits per point position. Incrementally encoded per-point normals are quantized at high fidelity using only 5 bits per normal (see Figure 1). The compressed data stream can be decoded in the graphics processing unit (GPU). Decoded point positions are saved in graphics memory, and they are then used on the GPU again to render point primitives. In this way we render gigantic point scans from their compressed representation in local GPU memory at interactive frame rates (see Figure 2). © The Eurographics Association 2005.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Functionality distribution for parallel rendering

Functionality distribution for parallel rendering

引用

19th ieee International parallel and Distributed Processing symposium, IPDPS 2005

作者： Rajagopalan, Ramgopal Goswami, Dhrubajyoti Mudur, Sudhir P. Computer Science and Software Engineering Concordia University 1455 de Maisonneuve Blvd. W. Montreal Que. H3G 1M8 Canada

ISBN: (纸本)0769523129

Handling very large datasets has been a key problem addressed in real-time distributed rendering research. With the advent of the programmable graphics Processing Unit (GPU), it is now possible and even profitable to move many application-specific computations to be carried out by the GPU. It has been shown that modern GPUs outperform the standard PC-platform CPUs on a broad class of computations by over a factor of seven [9]. Given the low costs and high processing speeds of GPUs, there is a trend towards using clusters of CPU/GPU systems. Configuring and programming these clusters for efficient distribution of data and computations is a major challenge. What are the computations that can be offloaded from the CPU to a GPU? The answer to this question is not simple as it depends on the following four factors: GPU's processing capacity, CPU's internal bandwidth, GPU-CPU communication bandwidth and the external network bandwidth. All these factors are subject to change with every generation of hardware. But additions and alternatives to the traditional data-parallel architectures are now needed to exploit the full capability of such clusters using functional parallelism. In this paper, we present a number of architectural configurations that could be adapted on such clusters. Specifically, we demonstrate use of one such architecture: application of a GPU-based pipelined architecture to our work on real-time processing and rendering of large-point datasets which demands complex computations. We have also introduced a list of application and system parameters that are necessary to determine an optimal distribution of computation on the GPUs of a graphics cluster.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Scalable, robust visualization of very large trees

Scalable, robust visualization of very large trees

引用

7th Joint Eurographics - ieee VGTC symposium on visualization, VisSym 2005

作者： Beermann, Dale Munzner, Tamara Humphreys, Greg University of Virginia United States University of British Columbia Canada

ISBN: (纸本)3905673193

The TreeJuxtaposer system [MGT∗03] allowed visual comparison of large trees with guaranteed visibility of landmarks and Focus+Context navigation. While that system allowed exploration and comparison of larger datasets than previous work, it was limited to a single tree of 775,000 nodes by a large memory footprint. In this paper, we describe the theoretical limitations to TreeJuxtaposer’s architecture that severely restrict its scalability. We provide two scalable, robust solutions to these limitations: TJC and TJC-Q. TJC is a system that supports browsing trees up to 15 million nodes by exploiting leading-edge graphics hardware while TJC-Q allows browsing trees up to 5 million nodes on commodity platforms. Both of these systems use a fast new algorithm for drawing and culling and benefit from a complete redesign of all data structures for more efficient memory usage and reduced preprocessing time. © The Eurographics Association 2005.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dense geometric flow visualization

Dense geometric flow visualization

引用

7th Joint Eurographics - ieee VGTC symposium on visualization, VisSym 2005

作者： Park, Sung W. Budge, Brian Linsen, Lars Hamann, Bernd Joy, Kenneth I. Department of Computer Science University of California Davis DavisCA95616 United States Department of Mathematics and Computer Science Ernst-Moritz-Arndt-Universität Greifswald Greifswald Germany

ISBN: (纸本)3905673193

We present a flow visualization technique based on rendering geometry in a dense, uniform distribution. Flow is integrated using particle advection. By adopting ideas from texture-based techniques and taking advantage of parallelism and programmability of contemporary graphics hardware, we generate streamlines and pathlines addressing both steady and unsteady flow. Pipelining is used to manage seeding, advection, and expiration of streamlines/pathlines with constant lifetime. We achieve high numerical accuracy by enforcing short particle lifetimes and employing a fourth-order integration method. The occlusion problem inherent to dense volumetric representations is addressed by applying multi-dimensional transfer functions (MDTFs), restricting particle attenuation to regions of certain physical behavior, or features. Geometry is rendered in graphics hardware using techniques such as depth sorting, illumination, haloing, flow orientation, and depth-based color attenuation to enhance visual perception. We achieve dense geometric three-dimensional flow visualization with interactive frame rates. © The Eurographics Association 2005.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design issues of a novel toolkit for parallel application performance monitoring and analysis in cluster and grid environments

Design issues of a novel toolkit for parallel application pe...

引用

8th International symposium on parallel Architectures, Algorithms and Networks, I-SPAN 2005

作者： Li, Kuan-Ching Wang, Hsiao-Hsi Chen, Chiou-Nan Liu, Chun-Chieh Chang, Chia-Fu Hsu, Chia-Wen Hung, Sheng-Shiang Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Shalu Taichung 43301 Taiwan Laboratory of Bioinformatics and Computational Biology Department of Computer Science National Tsing Hua University Hsinchu 30013 Taiwan

ISBN: (纸本)0769525091

The low-cost and availability of network of workstations have made them attractive solution for high performance computing. Striking progress of network technology is enabling high-performance global computing, with the utilization of cluster and grid technologies, in which computational and data resources in a local or wide area network are transparently employed to solve large-scale problems. In this paper, we present implementation and design rationale of Visuel* toolkit for performance measurement and analysis of parallel applications in cluster and grid environments. Most of performance visualization tools available today for high-performance platforms show solely system performance data (e.g., CPU load, memory usage, network bandwidth, server average load), and thus, being suitable for visualization of computing platform system activities. The Visuel toolkit is web-based interface designed to show performance, activities of all computing nodes of a cluster or grid computing platform involved in the execution of a parallel application, such as CPU load level and memory usage of each computing node. In addition, this toolkit is able to display comparative performance data visualizations generated from a number of executions of an application under investigation, analyzing the performance of different implementations. Evaluations using this toolkit show that it outperforms in easing the process of investigation and implementation of parallel applications, in effective way. © 2005 ieee.

关键词： Computer workstations

来源：评论

学校读者我要写书评

暂无评论

An interactive 3D integration of parallel coordinates and star glyphs

An interactive 3D integration of parallel coordinates and st...

引用

ieee symposium on Information visualization (INFOVIS)

作者： E. Fanea S. Carpendale T. Isenberg Canada Department of Computer Science University of Calgary Canada

parallel coordinates are a powerful method for visualizing multidimensional data but, when applied to large data sets, they become cluttered and difficult to read. Star glyphs, on the other hand, can be used to display either the attributes of a data item or the values across all items for a single attribute. Star glyphs may readily provide a quick impression; however, since the full data set require multiple glyphs, overall readings are more difficult. We present parallel glyphs, an interactive integration of the visual representations of parallel coordinates and star glyphs that utilizes the advantages of both representations to offset the disadvantages they have separately. We discuss the role of uniform and stepped colour scales in the visual comparison of non-adjacent items and star glyphs. parallel glyphs provide capabilities for focus-in-context exploration using two types of lenses and interactions specific to the 3D space.

关键词： data visualization Multidimensional systems Computer displays Computer science Lenses Chromium Computer graphics User interfaces Three dimensional displays data analysis

来源：评论

学校读者我要写书评

暂无评论

visualization for validation and improvement of three-dimensional segmentation algorithms

Visualization for validation and improvement of three-dimens...

引用

7th Joint Eurographics - ieee VGTC symposium on visualization, VisSym 2005

作者： Weber, G.H. Luengo Hendriks, C.L. Keränen, S.V.E. Dillard, S.E. Ju, D.Y. Sudar, D. Hamann, B. Berkeley Drosophila Transcription Network Project Visualization and Computer Graphics Research Group Institute for Data Analysis and Visualization University of California Davis One Shields Avenue DavisCA95616 United States Genomics and Life Sciences Division Lawrence Berkeley National Laboratory One Cyclotron Road BerkeleyCA94720 United States

ISBN: (纸本)3905673193

The Berkeley Drosophila Transcription Network Project (BDTNP) is developing a suite of methods that will allow a quantitative description and analysis of three dimensional (3D) gene expression patterns in an animal with cellular resolution. An important component of this approach are algorithms that segment 3D images of an organism into individual nuclei and cells and measure relative levels of gene expression. As part of the BDTNP, we are developing tools for interactive visualization, control, and verification of these algorithms. Here we present a volume visualization prototype system that, combined with user interaction tools, supports validation and quantitative determination of the accuracy of nuclear segmentation. visualizations of nuclei are combined with information obtained from a nuclear segmentation mask, supporting the comparison of raw data and its segmentation. It is possible to select individual nuclei interactively in a volume rendered image and identify incorrectly segmented objects. Integration with segmentation algorithms, implemented in MATLAB, makes it possible to modify a segmentation based on visual examination and obtain additional information about incorrectly segmented objects. This work has already led to significant improvements in segmentation accuracy and opens the way to enhanced analysis of images of complex animal morphologies. © The Eurographics Association 2005.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel sets: visual analysis of categorical data

Parallel sets: visual analysis of categorical data

引用

ieee symposium on Information visualization (INFOVIS)

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

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.

关键词： data analysis data visualization Information retrieval Histograms Frequency Filters Layout Crystallization Chromium Computer graphics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共120页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：