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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

686 篇 期刊文献
111 篇 会议
6 册 图书

馆藏范围

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

日期分布

学科分类号

553 篇 理学
- 390 篇 物理学
- 119 篇 数学
- 80 篇 化学
- 69 篇 生物学
- 60 篇 统计学（可授理学、...
- 15 篇 系统科学
- 11 篇 地球物理学
346 篇 工学
- 121 篇 计算机科学与技术...
- 99 篇 软件工程
- 79 篇 化学工程与技术
- 48 篇 核科学与技术
- 38 篇 生物工程
- 36 篇 信息与通信工程
- 36 篇 生物医学工程（可授...
- 34 篇 光学工程
- 32 篇 电子科学与技术（可...
- 29 篇 电气工程
- 21 篇 力学（可授工学、理...
- 20 篇 控制科学与工程
- 16 篇 土木工程
- 14 篇 冶金工程
- 11 篇 动力工程及工程热...
- 10 篇 机械工程
- 9 篇 建筑学
53 篇 管理学
- 29 篇 图书情报与档案管...
- 25 篇 管理科学与工程(可...
43 篇 医学
- 37 篇 临床医学
- 27 篇 基础医学(可授医学...
- 15 篇 公共卫生与预防医...
- 11 篇 药学(可授医学、理...
13 篇 农学
8 篇 法学
3 篇 经济学
3 篇 教育学
1 篇 文学
1 篇 艺术学

主题

75 篇 hadrons
50 篇 hadron colliders
46 篇 hadronic decays
38 篇 bottom mesons
34 篇 branching fracti...
30 篇 particle decays
26 篇 leptonic, semile...
25 篇 flavor changing ...
21 篇 bosons
21 篇 charmed mesons
18 篇 quark model
17 篇 cp violation
16 篇 visualization
15 篇 supersymmetry
15 篇 rare decays
14 篇 tellurium compou...
14 篇 electroweak inte...
13 篇 quantum chromody...
13 篇 particle product...
12 篇 bottom baryons

机构

427 篇 department of ph...
420 篇 school of physic...
415 篇 department of ph...
414 篇 horia hulubei na...
414 篇 cavendish labora...
412 篇 center for high ...
411 篇 van swinderen in...
411 篇 imperial college...
408 篇 stfc rutherford ...
403 篇 h.h. wills physi...
403 篇 nikhef national ...
401 篇 iccub universita...
399 篇 institute of par...
396 篇 yandex school of...
396 篇 henryk niewodnic...
390 篇 school of physic...
389 篇 physik-institut ...
388 篇 university of ch...
387 篇 oliver lodge lab...
370 篇 departamento de ...

作者

253 篇 barter w.
249 篇 bellee v.
241 篇 beiter a.
227 篇 bowcock t.j.v.
227 篇 casse g.
219 篇 boettcher t.
217 篇 blake t.
217 篇 amato s.
216 篇 borsato m.
216 篇 betancourt c.
215 篇 bediaga i.
214 篇 braun s.
213 篇 borisyak m.
212 篇 bizzeti a.
211 篇 baryshnikov f.
211 篇 bencivenni g.
210 篇 brundu d.
209 篇 back j.j.
208 篇 bay a.
207 篇 cattaneo m.

语言

766 篇 英文
34 篇 其他
3 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=Institute for Data Analysis and Visualization and Department of Computer Science"

共 803 条记录，以下是751-760 订阅

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

详细简洁

排序：

A complete gradient clustering algorithm

A complete gradient clustering algorithm

引用

3rd International Conference on Artificial Intelligence and Computational Intelligence, AICI 2011

作者： Kulczycki, Piotr Charytanowicz, Malgorzata Systems Research Institute Polish Academy of Sciences Center for Stochastic Data Analysis Methods Newelska 6 PL-01-447 Warsaw Poland Cracow University of Technology Department of Automatic Control and Information Technology Cracow Poland Catholic University of Lublin Institute of Mathematics and Computer Science Lublin Poland

ISBN: (纸本)9783642238956

A gradient clustering algorithm, based on the nonparametric methodology of statistical kernel estimators, expanded to its complete form, enabling implementation without particular knowledge of the theoretical aspects or laborious research, is presented here. The possibilities of calculating tentative optimal parameter values, and then - based on illustrative interpretation - their potential changes, result in the proposed Complete Gradient Clustering Algorithm possessing many original and valuable, from an applicational point of view, properties. Above all the number of clusters is not arbitrarily imposed but fitted to a real data structure. It is also possible to increase the scale of the number (still avoiding arbitrary assumptions), as well as the proportion of clusters in areas of dense and sparse situation of data elements. The method is universal in character and can be applied to a wide range of practical problems, in particular from the bioinformatics, management and engineering fields. © 2011 Springer-Verlag.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Real Time Collaborative Video Annotation Using Google App Engine and XMPP Protocol

Real Time Collaborative Video Annotation Using Google App En...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Abbas Attarwala Deepak Jagdish Ute Fischer Department of Computer Science University of Toronto Toronto ONT Canada Data Visualization & Design Nokia Research Center Palo Alto CA USA School of Literature & Communication Georgia Institute of Technology Atlanta GA USA

This WIP paper reports the status of a Windows based tool, 'Event Coding and visualization of data' (ECOVRD) that allows real time collaborative video annotation using Google App Engine (GAE) and XMPP protocol. ECOVRD facilitates classification of live or video recorded individual and team behavior. It is designed with the dual purpose of advancing behavioral (observational) research and of supporting applied uses such as performance assessment and feedback during professional coaching. Users of ECOVRD can initiate a shared real-time video annotation with their social network (Google Buzz) via XMPP protocol. The custom-built publish/subscribe architecture wrapped around GAE's channel service, pushes data from the cloud to subscribed clients resulting in real-time collaborative experience. ECORVD may be the first to successfully leverage the server push framework of GAE for desktop based video annotation applications.

关键词： Cloud computing Conferences

来源：评论

学校读者我要写书评

暂无评论

Large data visualization on distributed memory multi-GPU clusters 2

Large data visualization on distributed memory multi-GPU clu...

引用

2nd ACM SIGGRAPH / Eurographics on High-Performance Graphics, HPG 2010

作者： Fogal, Thomas Childs, Hank Shankar, Siddharth Krüger, Jens Bergeron, R. Daniel Hatcher, Philip Scientific Computing and Imaging Institute University of Utah United States Department of Computer Science University of New Hampshire United States Lawrence Berkeley National Laboratory United States Interactive Visualization and Data Analysis Group DFKI Germany

ISBN: (纸本)9783905674262

data sets of immense size are regularly generated on large scale computing resources. Even among more traditional methods for acquisition of volume data, such as MRI and CT scanners, data which is too large to be effectively visualized on standard workstations is now commonplace. One solution to this problem is to employ a 'visualization cluster,' a small to medium scale cluster dedicated to performing visualization and analysis of massive data sets generated on larger scale supercomputers. These clusters are designed to fit a different need than traditional supercomputers, and therefore their design mandates different hardware choices, such as increased memory, and more recently, graphics processing units (GPUs). While there has been much previous work on distributed memory visualization as well as GPU visualization, there is a relative dearth of algorithms which effectively use GPUs at a large scale in a distributed memory environment. In this work, we study a common visualization technique in a GPU-accelerated, distributed memory setting, and present performance characteristics when scaling to extremely large data sets. The Eurographics Association 2010.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Quantitative visualization of ChIP-chip data by using linked views

Quantitative visualization of ChIP-chip data by using linked...

引用

IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)

作者： Min-Yu Huang Gunther H. Weber Xiao-Yong Li Mark D. Biggin Bernd Hamann Institute for Data Analysis and Visualization (IDAV) Department of Computer Science University of California슠Davis Davis CA USA Visualization Group Lawrence Berkeley National Laboratory Berkeley CA USA Genomics Divisions Lawrence Berkeley National Laboratory Berkeley CA USA Institute for Data Analysis and Visualization (IDAV) Department of Computer Science University of California Davis Davis CA USA

Most analyses of ChIP-chip in vivo DNA binding have focused on qualitative descriptions of whether genomic regions are bound or not. There is increasing evidence, however, that factors bind in a highly overlapping manner to the same genomic regions and that it is quantitative differences in occupancy on these commonly bound regions that are the critical determinants of the different biological specificity of factors. As a result, it is critical to have a tool to facilitate the quantitative visualization of differences between transcription factors and the genomic regions they bind to understand each factor's unique roles in the network. We have developed a framework which combines several visualizations via brushing-and-linking to allow the user to interactively analyze and explore in vivo DNA binding data of multiple transcription factors. We describe these visualization types and also provide a discussion of biological examples in this paper.

关键词： Correlation Bioinformatics data visualization Genomics Image color analysis Browsers

来源：评论

学校读者我要写书评

暂无评论

Fast ultrasound beam prediction for linear and regular two- dimensionalarrays

Fast ultrasound beam prediction for linear and regular two- ...

引用

IEEE International Ultrasonics Symposium

作者： Hlawitschka, Mario McGough, Robert J. Ferrara, Katherine W. Kruse, Dustin E. Institute for Data Analysis and Visualization University of California Davis CA 95616 United States Department of Electrical and Computer Engineering Michigan State University East Lansing MI 48824 United States Department of Biomedical Engineering University of California Davis CA 95616 United States

ISBN: (纸本)9781457703829

Real-time beam predictions are desirable for ultrasound therapy guidance,as treatment planning requires individualized computations. To address thelong-standing issue of the computational burden associated with calculating theacoustic field in large volumes, we use modern graphics processing units toaccelerate the calculation of near-field pressure fields for therapeuticultrasound arrays. First, we accelerate field computations for singlerectangular pistons by employing the Fast Near-field Method (FNM) to accuratelyand efficiently estimate the complex near-field wave patterns in homogeneousmedia, and results are compared to the Rayleigh-Sommerfeld method. We thencompute beam patterns of 1D and 2D piston arrays using pre-calculated beampatterns from a single piston. Our results show that these algorithms canbenefit greatly from GPU computing hardware, exceeding a modern CPU by a factorof over 100. For a single rectangular piston, the FNM is able to calculate a0.01% accurate field within 30 ns per field point. Furthermore, we demonstratecalculation speeds for arrays of up to 11.5 109 field points persecond. Beam volumes containing 2563 field points are calculatedwithin one second for arrays containing up to 512 pistons, thus, facilitatingfuture real-time thermal dose predictions. © 2010 IEEE.

关键词： Pistons

来源：评论

学校读者我要写书评

暂无评论

Fast ultrasound beam prediction for linear and regular two-dimensional arrays

Fast ultrasound beam prediction for linear and regular two-d...

引用

ISBN: (纸本)9781457703829

Real-time beam predictions are desirable for ultrasound therapy guidance, as treatment planning requires individualized computations. To address the long-standing issue of the computational burden associated with calculating the acoustic field in large volumes, we use modern graphics processing units to accelerate the calculation of near-field pressure fields for therapeutic ultrasound arrays. First, we accelerate field computations for single rectangular pistons by employing the Fast Near-field Method (FNM) to accurately and efficiently estimate the complex near-field wave patterns in homogeneous media, and results are compared to the Rayleigh-Sommerfeld method. We then compute beam patterns of 1D and 2D piston arrays using pre-calculated beam patterns from a single piston. Our results show that these algorithms can benefit greatly from GPU computing hardware, exceeding a modern CPU by a factor of over 100. For a single rectangular piston, the FNM is able to calculate a 0.01% accurate field within 30 ns per field point. Furthermore, we demonstrate calculation speeds for arrays of up to 11.5 109 field points per second. Beam volumes containing 2563 field points are calculated within one second for arrays containing up to 512 pistons, thus, facilitating future real-time thermal dose predictions. © 2010 IEEE.

关键词： Pistons

来源：评论

学校读者我要写书评

暂无评论

Large data visualization on Distributed Memory Multi-GPU Clusters 10

Large Data Visualization on Distributed Memory Multi-GPU Clu...

引用

Conference on High-performance Graphics

作者： Thomas Fogal Hank Childs Siddharth Shankar Jens Kriiger R. Daniel Bergeron Philip Hatcher Scientific Computing & Imaging Institute University of UtahDepartment of Computer Science University of New Hampshire Lawrence Berkeley National Laboratory Scientific Computing & Imaging Institute University of Utah Interactive Visualization and Data Analysis Group DFKI Germany Department of Computer Science University of New Hampshire

ISBN: (纸本)9781617827242

关键词： distributed memory data visualisation visualization dataset supercomputer Representation of data performance characteristics

来源：评论

学校读者我要写书评

暂无评论

Shrinking large visual vocabularies using multi-label agglomerative information bottleneck

Shrinking large visual vocabularies using multi-label agglom...

引用

IEEE International Conference on Image Processing

作者： Wojciech Wojcikiewicz Alexander Binder Motoaki Kawanabe Department of Computer Science Technical University Berlin Berlin Germany Intelligent Data Analysis Group Fraunhofer Institute FIRST Berlin Germany

The quality of visual vocabularies is crucial for the performance of bag-of-words image classification methods. Several approaches have been developed for codebook construction, the most popular method is to cluster a set of image features (e.g. SIFT) by k-means. In this paper, we propose a two-step procedure which incorporates label information into the clustering process by efficiently generating a large and informative vocabulary using class-wise k-means and reducing its size by agglomerative information bottleneck (AIB). We introduce an extension of the AIB procedure for multi-label problems and show that this two-step approach improves the classification results while reducing computation time compared to the vanilla k-means. We analyse the reasons for the performance gain on the PASCAL VOC 2007 data set.

关键词： Vocabulary visualization Kernel Performance gain Training Clustering algorithms Histograms

来源：评论

学校读者我要写书评

暂无评论

Out-of-core data management for path tracing on hybrid resources

Out-of-core data management for path tracing on hybrid resou...

引用

30th Annual Conference on European Association for computer Graphics, EUROGRAPHICS 2009

作者： Budge, Brian Bernardin, Tony Stuart, Jeff A. Sengupta, Shubhabrata Joy, Kenneth I. Owens, John D. Institute for Data Analysis and Visualization Department of Computer Science Davis United States Department of Electrical and Computer Engineering University of California Davis United States

We present a software system that enables path-traced rendering of complex scenes. The system consists of two primary components: an application layer that implements the basic rendering algorithm, and an out-of-core scheduling and data-management layer designed to assist the application layer in exploiting hybrid computational resources (e.g., CPUs and GPUs) simultaneously. We describe the basic system architecture, discuss design decisions of the system's data-management layer, and outline an efficient implementation of a path tracer application, where GPUs perform functions such as ray tracing, shadow tracing, importance-driven light sampling, and surface shading. The use of GPUs speeds up the runtime of these components by factors ranging from two to twenty, resulting in a substantial overall increase in rendering speed. The path tracer scales well with respect to CPUs, GPUs and memory per node as well as scaling with the number of nodes. The result is a system that can render large complex scenes with strong performance and scalability. © 2008 The Author(s).

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Maximizing adaptivity in hierarchical topological models using cancellation trees

Maximizing adaptivity in hierarchical topological models usi...

引用

Workshop on Mathematical Foundations of Scientific visualization, computer Graphics, and Massive data Exploration, 2004

作者： Bremer, Peer-Timo Pascucci, Valerio Hamann, Bernd Department of Computer Science University of Illinois Urbana-Champaign United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Institute for Data Analysis and Visualization Department of Computer Science University of California Davis United States

ISBN: (纸本)9783642543005

We present a highly adaptive hierarchical representation of the topology of functions defined over two-manifold domains. Guided by the theory of Morse–Smale complexes, we encode dependencies between cancellations of critical points using two independent structures: a traditional mesh hierarchy to store connectivity information and a new structure called cancellation trees to encode the configuration of critical points. Cancellation trees provide a powerful method to increase adaptivity while using a simple, easy-to-implement data structure. The resulting hierarchy is significantly more flexible than the one previously reported (IEEE Trans. Vis. Comput. Graph. 10(4):385–396, 2004). In particular, the resulting hierarchy is guaranteed to be of logarithmic height. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共81页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：