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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

40 篇 会议
13 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

34 篇 工学
- 28 篇 计算机科学与技术...
- 23 篇 软件工程
- 8 篇 电气工程
- 8 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 电子科学与技术（可...
- 3 篇 船舶与海洋工程
- 3 篇 生物工程
- 3 篇 网络空间安全
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
17 篇 理学
- 11 篇 数学
- 7 篇 物理学
- 3 篇 生物学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学
14 篇 管理学
- 10 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
- 3 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 文学
- 1 篇 新闻传播学

主题

3 篇 costs
2 篇 ultrasonic imagi...
2 篇 imaging
2 篇 task analysis
2 篇 automatic testin...
2 篇 image segmentati...
2 篇 software enginee...
2 篇 self-supervised ...
2 篇 ultrasonics
2 篇 computational mo...
2 篇 software testing
2 篇 decision making
2 篇 feature extracti...
2 篇 tongue
2 篇 adders
2 篇 scheduling algor...
2 篇 data models
2 篇 open source soft...
2 篇 training
1 篇 aerospace testin...

机构

7 篇 national key lab...
6 篇 national univers...
5 篇 xiangjiang lab
5 篇 tongji universit...
4 篇 school of advanc...
4 篇 school of comput...
4 篇 national laborat...
4 篇 national lab. of...
4 篇 national key lab...
3 篇 key lab. of para...
3 篇 national key lab...
3 篇 key lab. of para...
2 篇 national key lab...
2 篇 key lab. of para...
2 篇 budapest univers...
2 篇 lingcore lab. po...
2 篇 tongji univ.
2 篇 key lab. of para...
2 篇 school of comput...
2 篇 ece department p...

作者

9 篇 wang huaimin
7 篇 wang tao
6 篇 kele xu
6 篇 xu kele
5 篇 ming feng
5 篇 yin gang
4 篇 peichang shi
4 篇 tan qingping
3 篇 zhenghua wang
3 篇 boqing zhu
3 篇 guodong yi
3 篇 feng ming
3 篇 liu feng
3 篇 fei gao
3 篇 yang cheng
3 篇 kang you
3 篇 penghui ma
3 篇 shi peichang
3 篇 csapó tamás gábo...
3 篇 huaimin wang

语言

53 篇 英文

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

共 53 条记录，以下是1-10 订阅

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

详细简洁

排序：

RIMP: Runtime IMplicit Predication

引用

6th International Workshop on Advanced parallel processing Technologies

作者： Tang, Y Deng, K Wang, XD Dou, Y Zhou, XM National Lab. for Parallel and Distributed Processing China

ISBN: (纸本)3540296395

If-conversion and predicated execution are widely adopted to eliminate branch misprediction penalty. Previous predication execution depends on compiler to generate explicit predicated instructions, In this paper, a trace-based predicate mechanism named RIMP (Runtime IMplicit Predication) is discussed. The candidates of if-conversion will be identified during dynamic execution. Conventional trace cache has been modified to store RIMP traces, which include instructions both from fall-through and target block following the conditional branch. Hardware extension will add predication to RIMP trace automatically. With the help of RIMP, legacy applications can benefit from predication mechanism without recompiling source code. Simulation of RIMP implementation under diverse microarchitecture configurations is presented in the paper. Results have shown promising performance improvement. In general, RIMP with 64kB trace storage delivers an average 10.3% IPC improvement while actually speeding up the execution time by over 7%.

关键词： predication trace cache runtime execution RIMP

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reduction transformations for optimization parameter selection

Reduction transformations for optimization parameter selecti...

引用

8th International Conference on High-Performance Computing in Asia-Pacific Region, HPC Asia 2005

作者： Yonggang, Che Zhenghua, Wang Xiaomei, Li National Lab. for Parallel and Distributed Processing Changsha 410073 China

ISBN: (纸本)0769524869

Program performance optimization often involves choosing right parameters to minimize the program's runtime. Selecting optimization parameters by means of execution-driven search is guaranteed to find excellent results, for it accurately accounts for all performance components of the target platform. But the major drawback of execution-driven approach is the excessive compilation time due to thousands of runs of the original program. In this article, we propose a novel technique called program reduction transformations to reduce the cost of execution-driven optimization parameter selection. It is based on our observation to the characteristics of the scientific applications and the optimization parameter selection task. The ideal is to transform the program before it is used in execution-driven parameter selection procedure. The transformed program runs in much shorter time but preserves the parameter selection quality. This technique greatly reduces the time spent on evaluating each candidate parameter and makes execution-driven optimization parameter selection affordable. We formulate the theoretic foundation of program reduction transformation. And we find several situations where reduction transformations can be legally applied. These situations are common in scientific applications. Experiments done for two math kernels and three SPEC benchmarks show that our approach is both feasible and effective. © 2005 IEEE.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

An improved independent set ordering algorithm for solving large-scale sparse linear systems

An improved independent set ordering algorithm for solving l...

引用

International Conference on Intelligent Human-Machine Systems and Cybernetics

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

ISBN: (纸本)9780769541518

The independent set ordering algorithm is a heuristic algorithm based on finding maximal independent sets of vertices in the matrix adjacency graph, which is commonly used for parallel matrix factorization. However, Disadvantages appear when it is applied to large-scale sparse linear systems. In this paper, we propose an improved algorithm by finding an optimal size of independent set in each elimination step rather than find a maximal independent set, which is proved to be effective by both theoretical analysis and parallel implementation. © 2010 IEEE.

关键词： Lower-upper decomposition

来源：评论

学校读者我要写书评

暂无评论

Efficient virtual machine deployment in large scale resource environment

Efficient virtual machine deployment in large scale resource...

引用

16th IEEE International Conference on parallel and distributed Systems, ICPADS 2010

作者： Huang, Feng Li, Dongsheng National Lab. for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769543079

Combining virtual machine technology, virtual computing is able to effectively aggregate the widely distributed resources to provide users services. We view the federation of multiple data centers and voluntary resources on the Internet as a very large scale resource pool. Based on the tree structure of the pool, this paper proposes a virtual machine deployment algorithm, called iVDA, considers users' requests and the capabilities of the physical resources as well as the dynamic load, implements an adaptive mechanism to scheduling servers to host virtual machines forming virtual execution environments for various applications, and supports on-demand computing. © 2010 IEEE.

关键词： Dynamic loads

来源：评论

学校读者我要写书评

暂无评论

Skyline query processing on interval uncertain data

Skyline query processing on interval uncertain data

引用

作者： Li, Xiaoyong Wang, Yijie Li, Xiaoling Wang, Guangdong National Lab. for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769546698

Many recent applications involve processing and analyzing uncertain data. Recently, several research efforts have addressed answering skyline queries efficiently on massive uncertain datasets. However, the research lacks methods to compute these queries on uncertain data, where each dimension of the uncertain object is represented as an interval or an exact value. In this paper, we extensively study the problem of skyline query on these interval based uncertain objects, which has never been studied before. We first model the problem of querying the skylines on interval datasets. Typically, we address two efficient algorithms with I/O optimal for the conventional interval skyline queries and constrained interval skyline queries, respectively. Extensive experiments demonstrate the efficiency of all our proposed algorithms. © 2012 IEEE.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Study of a code comment decision method based on structural features

Study of a code comment decision method based on structural ...

引用

2019 International Conference on Intelligent Computing, Automation and Systems, ICICAS 2019

作者： Wang, Renmin Wang, Tao Wang, Huaimin Key Lab. of Parallel and Distributed Computing National University of Defense Technology Changsha China

ISBN: (纸本)9781728161068

Code comment is one of the most effective ways to help programmers to understand the source code. High-quality comment decisions can not only cover the core code snippets in the software system but also avoid generating redundant code comments. However, in actual development, there is no uniform comment specification, and most of the comment decisions depend on personal experience and domain knowledge. This paper has learned a common comment decision specification from a large number of code comment examples to assist programmers in making appropriate comment decisions during code development. This paper proposes a method to extract the code structure from the context code of the current code line, and use the machine learning algorithm to determine the possibility that the current code needs to add comments. The proposed method was evaluated on 8 well-known open-source Python projects in GitHub and the experimental results show the feasibility and effectiveness of the method in some code types. © 2019 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Formal Proof for a General Architecture of Hybrid Prefix/Carry-Select Adders

Formal Proof for a General Architecture of Hybrid Prefix/Car...

引用

10th International Conference on Algorithms and Architectures for parallel processing

作者： Liu, Feng Tan, Qingping Song, Xiaoyu Chen, Gang National Lab. of Parallel Distributed Processing Hunan China ECE Department Portland State University Portland OR United States Lingcore Lab. Portland OR United States

ISBN: (纸本)9783642131189

In this paper, we present a general architecture of hybrid prefix/carry-select adder. Based on this architecture, we formalize the hybrid adder's algorithm using the first-order recursive equations and develop a proof framework to prove its correctness. Since several previous adders in the literature are special cases of this general architecture, our methodology can be used to prove the correctness of different hybrid prefix/carry-select adders. The formal proof for a special hybrid prefix/carry-select adder shows the effectiveness of the algebraic structures built in this paper.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

Creating virtual networks for distributed virtual computing environment

Creating virtual networks for distributed virtual computing ...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Li, Dongsheng Chen, Yixin Huang, Feng National Lab. for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha City Hunan Province China

ISBN: (纸本)9780769539003

Virtual network is an important approach to support multiple legacy applications running unmodified in distributed virtual computing environments. A virtual networking approach called VirNet is proposed in this paper. VirNet can build multiple customized and isolated virtual networks simultaneously on the same physical hosts in the network, and it enables existing distributed applications written for LANs to run seamlessly on Internet. VirNet is designed completely in user space and requires no change to the kernel of operating systems. Experimental evaluation performed by a reference implementation shows that VirNet is efficient. The latency overhead caused by VirNet is very small and the bandwidth of VirNet is more than 85% of the availab.e physical network bandwidth in both the LAN and emulated WAN environments. © 2009 IEEE.

关键词： Taps

来源：评论

学校读者我要写书评

暂无评论

A high efficient in-place transposition scheme for multidimensional arrays

A high efficient in-place transposition scheme for multidime...

引用

3rd International Conference on Information and Computing, ICIC 2010

作者： Yuan, Jie Wu, Jian-Ping Wang, Zheng-Hua National Lab. of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer Science National University of Defense Changsha China

ISBN: (纸本)9780769540474

This paper presents a in-place cycle-reducing method for multidimensional arrays transposition in local memory to reduce the memory R/W operations. The resulting method can significantly reduce the number of subcycles (also called following-cycles) and that of memory operations for square arrays. Taking square array 256 by 256 for example, the number of subcycles used by current availab.e best algorithm can be reduced from 32894 to only 574, using our new method, and the memory operation number can be reduced by about 32.58%, from 98430 to 66366. Taking advantage of this new method, the elapsed time can be reduced as a result. The number of cycles and operations can also be reduced for 2D rectangle arrays with 2m rows and 2n column stored in column-major, especially n=2m, even though the improvement is not as significant as that for square arrays. The improved 2D in-place algorithm has been extended to 3D arrays, and some theoretic and numerical results are also provided. Furthermore, we develop a new in-place 3D arrays transposition algorithm. This algorithm is very important for a deep research for multidimensional arrays. Experimental results show that our algorithm can improve efficiency significantly, compared to some other 3D array transposition schemes. © 2010 IEEE.

关键词： Multidimensional array Memory operation Cycle-reducing Transposition In-place transposition Transposition arrays three-dimensional array Local Memory MULTIDIMENSIONAL

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：