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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

847 篇 会议
289 篇 期刊文献
3 册 图书

馆藏范围

1,139 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

723 篇 工学
- 568 篇 计算机科学与技术...
- 415 篇 软件工程
- 130 篇 信息与通信工程
- 80 篇 电子科学与技术（可...
- 76 篇 控制科学与工程
- 54 篇 生物工程
- 53 篇 机械工程
- 40 篇 电气工程
- 25 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 21 篇 化学工程与技术
- 19 篇 材料科学与工程（可...
- 15 篇 网络空间安全
- 14 篇 土木工程
- 13 篇 建筑学
- 12 篇 力学（可授工学、理...
- 12 篇 农业工程
- 11 篇 交通运输工程
- 11 篇 环境科学与工程（可...
276 篇 理学
- 174 篇 数学
- 57 篇 生物学
- 47 篇 物理学
- 38 篇 系统科学
- 38 篇 统计学（可授理学、...
- 23 篇 化学
182 篇 管理学
- 124 篇 管理科学与工程(可...
- 61 篇 图书情报与档案管...
- 37 篇 工商管理
18 篇 法学
- 15 篇 社会学
17 篇 经济学
- 17 篇 应用经济学
13 篇 农学
9 篇 教育学
7 篇 医学
3 篇 文学
3 篇 军事学
2 篇 艺术学

主题

46 篇 distributed proc...
44 篇 laboratories
42 篇 computational mo...
31 篇 kernel
29 篇 algorithm design...
28 篇 concurrent compu...
28 篇 computer archite...
27 篇 graphics process...
27 篇 benchmark testin...
25 篇 fault tolerance
25 篇 hardware
24 篇 feature extracti...
23 篇 throughput
23 篇 semantics
22 篇 servers
22 篇 cloud computing
21 篇 parallel process...
21 篇 protocols
21 篇 training
20 篇 deep learning

机构

170 篇 national laborat...
134 篇 science and tech...
102 篇 college of compu...
91 篇 national laborat...
79 篇 national laborat...
39 篇 school of comput...
37 篇 national laborat...
29 篇 national key lab...
24 篇 national key lab...
22 篇 science and tech...
22 篇 national key lab...
18 篇 national laborat...
17 篇 laboratory of di...
16 篇 national laborat...
15 篇 national univers...
14 篇 national laborat...
13 篇 national key lab...
13 篇 college of compu...
13 篇 school of comput...
12 篇 national laborat...

作者

44 篇 yong dou
42 篇 wang huaimin
39 篇 li dongsheng
39 篇 dou yong
38 篇 dongsheng li
38 篇 liu jie
36 篇 wang ji
36 篇 huaimin wang
35 篇 ji wang
31 篇 jie liu
30 篇 xiaodong wang
30 篇 yijie wang
28 篇 wang yijie
26 篇 peng yuxing
26 篇 yin gang
25 篇 yuxing peng
25 篇 gang yin
22 篇 tao wang
21 篇 zhigang luo
21 篇 xicheng lu

语言

1,039 篇 英文
55 篇 中文
45 篇 其他

检索条件"机构=National Key Laboratory for Parallel and Distributed Processing"

共 1139 条记录，以下是851-860 订阅

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

详细简洁

排序：

Feature preserving consolidation for unorganized point clouds

Feature preserving consolidation for unorganized point cloud...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Li, Bao Jiang, Wei Cheng, Zhiquan Dang, Gang Jin, Shiyao National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424467860

We introduce a novel method for the consolidation of unorganized point clouds with noise, outliers, non-uniformities as well as sharp features. This method is feature preserving, in the sense that given an initial estimation of normal, it is able to recover the sharp features contained in the original geometric data which are usually contaminated during the acquisition. The key ingredient of our approach is a weighting term from normal space as an effective complement to the recently proposed consolidation techniques. Moreover, a normal mollification step is employed during the consolidation to get normal information respecting sharp features besides the position of each point. Experiments on both synthetic and real-world scanned models validate the ability of our approach in producing denoised, evenly distributed and feature preserving point clouds, which are preferred by most surface reconstruction methods. ©2010 IEEE.

关键词： Consolidation Feature preserving Point clouds Sharp features

来源：评论

学校读者我要写书评

暂无评论

Link scheduling in wireless networks with successive interference cancellation

Link scheduling in wireless networks with successive interfe...

引用

International Conference on Mobile Ad-hoc and Sensor Networks

作者： Lv, Shaohe Wang, Xiaodong Zhou, Xingming National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9780769543154

Successive interference cancellation (SIC) is an effective technique of multipacket reception to combat interference. As not all collision are resolvable, careful transmission coordination is required. We study link scheduling in wireless networks with SIC at the physical layer. A new model, simultaneity graph (SG), is proposed to characterize the link correlation introduced by SIC. Then two new scheduling schemes are presented: 1) a slotoriented scheme which assigns a maximal feasible link set to a time slot and 2) a link-oriented scheme which assigns each link a sufficient number of slots. The performance is evaluated by simulations and the results demonstrate that the throughput gain is on average 50% and up to 110% over IEEE 802.11. The complexity of SG is only a bit higher than that of the available widely-used models (e.g., conflict graph). © 2010 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Implementing Sparse Matrix-Vector multiplication using CUDA based on a hybrid sparse matrix format

Implementing Sparse Matrix-Vector multiplication using CUDA ...

引用

2010 International Conference on Computer Application and System Modeling, ICCASM 2010

作者： Cao, Wei Lu, Yao Li, Zongzhe Wang, Yongxian Wang, Zhenghua National Key Lab. for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424472369

The Sparse Matrix-Vector product (SpMV) is a key operation in engineering and scientific computing. Methods for efficiently implementing it in parallel are critical to the performance of many applications. Modern Graphics processing Units (GPUs) coupled with the advent of general purpose programming environments like NVIDIA's CUDA, have gained interest as a viable architecture for data-parallel general purpose computations. Currently, SpMV implementations using CUDA based on common sparse matrix format have already appeared. Among them, the performance of implementation based on ELLPACK-R format is the best. However, in this implementation, when the maximum number of nonzeros per row does substantially differ from the average, thread is suffering from load imbalance. This paper proposes a new matrix storage format called ELLPACK-RP, which combines ELLPACK-R format with JAD format, and implements the SpMV using CUDA based on it. The result proves that it can decrease the load imbalance and improve the SpMV performance efficiently. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A case study of SWIM: Optimization of memory intensive application on GPGPU

A case study of SWIM: Optimization of memory intensive appli...

引用

International Symposium on parallel Architectures, Algorithms, and Programming

作者： Yi, Wei Tang, Yuhua Wang, Guibin Fang, Xudong National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769543123

Recently, GPGPU has been adopted well in the High Performance Computing (HPC) field. The limited global memory bandwidth poses a great challenge to many GPGPU programmers trying to exploit parallelism within the CPUGPU heterogeneous platform. In this paper, we choose SWIM, a typical memory intensive application from the SPEC OMP 2001 benchmark suite, for case study. We attempt to optimize the performance and energy consumption of the application utilizing different memory access mechanisms and present optimization methods including matrix transposition and kernel fusion. The experimental results on the Intel CoreTM i920 CPU plus GeForce GTX 295 platform shows that, the proposed optimizing methods achieve a speedup of 8.7X over the original OpenMP program and reduce the energy consumption by 83% for the problem size of 2048*2048. © 2010 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Optimizing adaptive synchronization in parallel simulators for large-scale parallel systems and applications

Optimizing adaptive synchronization in parallel simulators f...

引用

10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Xu, Chuanfu Che, Yonggang Fang, Jianbin Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769541082

This paper addresses the optimization of parallel simulators for large-scale parallel systems and applications. Such simulators are often based on parallel discrete event simulation with conservative or optimistic protocols to synchronize the simulating processes. The paper considers how available future information about events and application behaviors can be efficiently extracted and further exploited to improve the performance of adaptive optimistic protocols. First, we extract information about future events and their dependencies in application traces to guide adaptive adjustments of time window in trace-driven parallel simulation. Second, we use information about application behaviors, specifically the iterative behavior found in many applications, to avoid the unnecessary adjustments of time window. These techniques are implemented in the BigSim simulator and tested by real-world and standard benchmark applications including Jacobi3D and HPL. The results show that our optimization approaches can reduce the execution times of simulation ranging from 11% up to 32%. Moreover, our methods are easy to implement and don't need to augment compilers or even modify the core codes of parallel simulators. © 2010 IEEE.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Effect of self and cross-coupling capacitance on stability diagram in a metallic double-dot device

Effect of self and cross-coupling capacitance on stability d...

引用

2010 3rd International Conference on Nanoscience and Nanotechnology, ICONN 2010

作者： Sui, Bingcai Fang, Liang Chi, Yaqing National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Hunan 410073 China

ISBN: (纸本)9781424452620

We investigate the effect of self and cross-coupling capacitance on stability diagram in a metallic double-dot device by theory and method. In linear transport regime, cross-coupling capacitances affect the dimension of the honeycomb cell and the distance of two triple points, while self capacitances only slightly broaden the boundary of the cell and make two triple point closer. In nonlinear transport regime, cross-coupling capacitances stretch the current region and charge region in the mid-line direction, while self capacitances extend the region of current regions but not change the shape of the stability cells. Cross-coupling capacitances make stronger impact on the dimensions of stability diagram than self capacitance. But the self-capacitance must be included in the current calculation if its value can not be neglected with respect to the device parameters. © 2010 IEEE.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Power-efficientwork distribution method for CPU-GPU heterogeneous system

Power-efficientwork distribution method for CPU-GPU heteroge...

引用

IEEE International Symposium on parallel and distributed processing With Applications

作者： Wang, Guibin Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769541907

As the system scales up continuously, the problem of power consumption for high performance computing (HPC) system becomes more severe. Heterogeneous system integrating two or more kinds of processors, could be better adapted to heterogeneity in applications and provide much higher energy efficiency in theory. Many studies have shown heterogeneous system is preferable on energy consumption to homogeneous system in a multi-programmed computing environment. However, how to exploit energy efficiency (Flops/Watt) of heterogeneous system for a single application or even for a single phase in an application has not been well studied. This paper proposes a power-efficient work distribution method for single application on a CPU-GPU heterogeneous system. The proposed method could coordinate inter-processor work distribution and per-processor's frequency scaling to minimize energy consumption under a given scheduling length constraint. We conduct our experiment on a real system, which equips with a multi-core CPU and a multi-threaded GPU. Experimental results show that, with reasonably distributing work over CPU and GPU, the method achieves 14% reduction in energy consumption than static mappings for several typical benchmarks. We also demonstrate that our method could adapt to changes in scheduling length constraint and hardware configurations. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Communication time models on fat-tree networks

Communication time models on fat-tree networks

引用

2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010

作者： Lin, Yufei Xu, Xinhai Lin, Yisong National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424465408

With the growth of supercomputer's scale, the communication time during executing is increasing. This phenomenon arouses the architecture researchers' interests. In this paper, based on the fat-tree topology, which is widely used in Infiniband, we present an one-to-all broadcast communication time model. After classifying applications into two kinds, we establish the ideal model and the bandwidth-limited model on the exponential-capacity binary fat-trees for the two kinds of applications. Through analyzing the models, we get the curves which describe the relationship between the communication time and the processor number. The conclusions we get in this paper can help system designers make better system design. © 2010 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Towards online application cache behaviors identification in CMPs

Towards online application cache behaviors identification in...

引用

IEEE International Conference on High Performance Computing and Communication

作者： Jia, Xiaomin Jiang, Jiang Zhao, Tianlei Qi, Shubo Zhang, Minxuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769542140

On chip multiprocessors (CMPs) platforms, multiple co-scheduled applications can severely degrade performance and quality of service (QoS) when they contend for last-level cache (LLC) resources. Whether an application will impose destructive interference on co-scheduled applications is largely dependent on its own inherent cache access behavior characteristics. In this work, we first present case studies that show how inter-application interferences result in undesirable performance in both shared and private cache based LLC designs. We then propose a new online approach for application cache behavior identification on the basis of detailed simulation and analysis with SPEC CPU2006 benchmarks. We demonstrate that our approach can more concisely identify application cache behaviors. Moreover, the proposed approach can be implemented directly in hardware to dynamically identify the application cache behaviors at runtime. Finally, we show with two case studies that how the proposed approach can be adopted by both shared and private based cache sharing mechanisms, i.e. cache partitioning algorithms (CPAs) and cache spilling techniques, for more concise cache resource management. © 2010 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Communication delay analysis based on network calculus

Communication delay analysis based on network calculus

引用

2010 2nd International Conference on Software Technology and Engineering, ICSTE 2010

作者： Lin, Yufei Xu, Xinhai Lin, Yisong National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424486656

Network calculus is a promising theory for analyzing and modeling networks based on min-plus algebra. Using network calculus theory, we propose formulas of arrival curve and service curve for end-to-end communication, build the corresponding time model, and derive the communication delay formulas for two scenarios of the model respectively. Then we take fat tree topology, which is widely used in Infiniband interconnection, as an example to analyze the delay of one-to-all broadcast. This paper, as a groundwork, provides a new approach for the network researchers to delve communication delay in future researches. © 2010 IEEE.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共114页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：