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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
295 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

730 篇 工学
- 575 篇 计算机科学与技术...
- 420 篇 软件工程
- 131 篇 信息与通信工程
- 81 篇 电子科学与技术（可...
- 76 篇 控制科学与工程
- 55 篇 生物工程
- 54 篇 机械工程
- 41 篇 电气工程
- 25 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 21 篇 化学工程与技术
- 18 篇 材料科学与工程（可...
- 15 篇 网络空间安全
- 14 篇 土木工程
- 12 篇 力学（可授工学、理...
- 12 篇 建筑学
- 12 篇 农业工程
- 11 篇 交通运输工程
- 11 篇 环境科学与工程（可...
279 篇 理学
- 176 篇 数学
- 58 篇 生物学
- 47 篇 物理学
- 39 篇 统计学（可授理学、...
- 38 篇 系统科学
- 22 篇 化学
185 篇 管理学
- 124 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 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

机构

169 篇 national laborat...
134 篇 science and tech...
103 篇 college of compu...
88 篇 national laborat...
81 篇 national laborat...
38 篇 school of comput...
38 篇 national laborat...
29 篇 national key lab...
23 篇 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 篇 school of comput...
12 篇 national laborat...
12 篇 college of compu...

作者

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

语言

1,058 篇 英文
63 篇 中文
24 篇 其他

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

共 1145 条记录，以下是581-590 订阅

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

详细简洁

排序：

A Exploratory Study of @-Mention in GitHub's Pull-Requests

A Exploratory Study of @-Mention in GitHub's Pull-Requests

引用

Asia-Pacific Conference on Software Engineering

作者： Yang Zhang Gang Yin Yue Yu Huaimin Wang National laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781479974276

Pull-request mechanism is an outstanding social development method in Git Hub. @-mention is a social media tool that deeply integrated with pull-request mechanism. Recently, many research results show that social media tools can promote the collaborative software development, but few work focuses on the impacts of @-mention. In this paper, we conduct an exploratory study of @-mention in pull-request based software development, including its current situation and benefits. We obtain some interesting findings which indicate that @-mention is beneficial to the processing of pull-request. Our work also proposes some possible research directions and problems of the @-mention. It helps the developers and researchers notice the significance of @-mention in the pull-request based software development.

关键词： Media Software Collaboration Software engineering Correlation Information services Electronic publishing

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers 14

Efficient deterministic multithreading without global barrie...

引用

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

作者： Lu, Kai Zhou, Xu Bergan, Tom Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China University of Washington Computer Science and Engineering United States

ISBN: (纸本)9781450326568

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 17 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. Copyright © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers

Efficient deterministic multithreading without global barrie...

引用

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 16 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

A piecewise-based contrast enhancement framework for low lighting video

A piecewise-based contrast enhancement framework for low lig...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Dongsheng Wang Xin Niu Yong Dou National Laboratory for Parallel & Distributed Processing National University of Defense Technology Changsha China

In this paper, we propose an efficient automatic contrast enhancement algorithm for low lighting video. The algorithm is based on a piecewise stretch on the brightness component extracted with Retinex theory in HSV space to improve the visuality of the image. By dividing the brightness component into dark and bright part, nonlinear transformations with different distribution assumption were performed respectively. All the model parameters were estimated automatically according to the illumination conditions. We use two methods to estimate the brightness. The one is global illumination estimation and the other is local illumination estimation. In comparison with global estimation, a local illumination estimation method is proposed for the further improvement. Experiments show that the algorithm can achieve satisfactory effect for nighttime image or video enhancement by comparing with some state-of-the-art approaches.

关键词： Brightness Lighting Estimation Histograms Transforms Real-time systems Image color analysis

来源：评论

学校读者我要写书评

暂无评论

Accelerating Embarrassingly parallel Algorithm on Intel MIC

Accelerating Embarrassingly Parallel Algorithm on Intel MIC

引用

2014 IEEE International Conference on Progress in Informatics and Computing

作者： Qinglin Wang Jie Liu XiantuoTang Feng Wang Guitao Fu Zuocheng Xing Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

The Embarrassingly parallel(EP) algorithm which is typical of many Monte Carloapplications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Intel released Many Integrated Core(MIC) architecture as a many-core co-processor. MIC often offers more than 50 cores each of which can run four hardware threads as well as 512-bit vector instructions. In this paper,we describe how the EP algorithm is accelerated effectively on the platforms containing MIC using the offload execution model. The result shows that the efficientimplementation of EP algorithm on MIC can take full advantage of MIC's computational resources and achieves a speedup of 3.06 compared with that on Intel Xeon E5-2670 CPU. Based on the EP algorithm on MIC and an effective task distribution model, the implementation of EP algorithm on a CPU-MIC heterogeneous platform achieves the performance of up to2134.86 Mop/s and 4.04 times speedup compared with that on Intel Xeon E5-2670 CPU.

关键词： NPB embarrassingly parallel algorithm heterogeneous platform many integrated core architecture

来源：评论

学校读者我要写书评

暂无评论

CCH-MAC: Evading hidden terminal in ad-hoc network

CCH-MAC: Evading hidden terminal in ad-hoc network

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Xuan Dong Shaohe Lv Yong Lu Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing University of Defense Technology Chansha China

Hidden terminal and collisions are well-known problems due to broadcasting nature of wireless network. In this paper, we address an efficient MAC protocol to evade the potential collisions caused by hidden terminals, where advanced phycical layer technique, full-duplex, is exploited to coordinate channel contention among nodes within two-hops range. Furhter-more, cooperative channel hopping(CCH) MAC is developed to improve the frequency efficiency by limiting the interference of hidden terminals and enabling a collision-free channel for further transmission. Basically, a fined channel hopping mechanism is proposed to avoid the continually interference and cooperative coordination is subjoined by the transmission of cyclic prefix. To the best of our knowledge, CCH-MAC validates the detection of subchannel contention on NI USRPs and evaluation via simulations shows that CCH-MAC achieves at least 35% throughput gain over FICA with a slightly loss in fairness.

关键词： Transmitters Interference Throughput Receivers Network topology Decoding Indexes

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of distributed Stage DB:A High Performance distributed key-Value Database

Design and Implementation of Distributed Stage DB:A High Per...

引用

2014 International Conference on Industrial Engineering and Information Technology

作者： Hui-jun Wu Kai Lu Gen Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

With the development of high performance computing and Web 2.0 applications,unstructured data storage becomes more and more *** RDBMS isn't efficient for big data ***,RDBMS's scalability is ***' expansion often leads to a large scale of data *** paper designs and implements a high performance distributed key-value database,which is distributed Stage *** servers are organized by a consistent hashing ring and distributed with the support of Zookeeper,a distributed service *** has a high single-node read/write *** route information is calculated by clients,which reduces the expense of expansion.

关键词： distributed system,database,key-value,Zookeeper

来源：评论

学校读者我要写书评

暂无评论

3D Pipeline Contention: Asymmetric Full Duplex in Wireless Networks

3D Pipeline Contention: Asymmetric Full Duplex in Wireless N...

引用

IEEE International Conference on Computer Communications

作者： Shaohe Lv Xuan Dong Yong Lu Xiaoli Du Xiaodong Wang Yong Dou Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

Coordination among users is an indispensable part in wireless networks for efficient medium access. Alone with the rapid increase of transmission rate, however, coordination time becomes insufferable. We present AFD, namely asymmetric full duplex, to achieve high coordination efficiency at nearly zero overhead. In AFD, channel contention is performed simultaneously with data transmission. We propose a 3D pipeline contention scheme where the contention process is divided into several parallel stages and executed in a pipelined manner in a 3D domain specified by time, frequency and spatial antenna. To mitigate the interference between the data packet and the contention signal, we adopt a singleton PN sequence as a contention pilot. AFD provides a novel network-scale full duplex capability. The performance is evaluated by both simulations and measurements in a testbed. AFD outperforms IEEE 802.11 significantly, i.e., the Jain's fairness index is around 0.95 with a throughput gain up to 120%.

关键词： Pipelines Data communication Antennas Three-dimensional displays Interference IEEE 802.11 Standards Time-frequency analysis

来源：评论

学校读者我要写书评

暂无评论

IWFR: Exploiting full-duplex in wireless relay networks

IWFR: Exploiting full-duplex in wireless relay networks

引用

International Conference on Information Science and Technology (ICIST)

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

Traditional wireless relay networks have large end-to-end time delay and low throughput because of the limit that it can't receive and forward at the same time. In this paper, we proposed IWFR: Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the throughput. At the same time, we designed a new implicit acknowledgement mechanism, which can eliminate the ACK overheads and evidently improve the throughput of the relay. To implement IWFR, we also modified the full-duplex node architecture to make it support for immediate relay. Simulation shows that IWFR shortens the end-to-end time delay by 60% on average and improves the throughput to 240% of the original relay.

关键词： Wireless communication Throughput Delay effects Wireless sensor networks Interference Relay networks (telecommunications)

来源：评论

学校读者我要写书评

暂无评论

DLSM: Decoupled Live Storage Migration with distributed Device Mapper Storage

DLSM: Decoupled Live Storage Migration with Distributed Devi...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Zhaoning Zhang Ziyang Li Kui Wu Huiba Li Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China University of Victoria Victoria BC CA

As a key technique in cloud computing, live virtual machine (VM) migration makes cloud computing elastic and renders more efficient resource scheduling. In many cases, live storage migration is also desirable. Compared to live VM migration, however, live storage migration is relatively slow. The speed gap between live VM migration and live storage migration may lead to poor Quality of Service (QoS) for cloud users. In this paper, we present a new resource migration scheme, called Decoupled Live Storage Migration (DLSM), which decouples the live storage migration from the live VM migration. DLSM can migrate the VM immediately, while data blocks actually required by the VM are moved on demand at later times. It achieves the on-demand data migration at the storage level without the need of modifying the hypervisor. The key contribution of DLSM is that it reduces the network traffic and speeds up the live storage migration, by completely eliminating iterative copy of dirty data over the network. This good property is achieved without relying on any tracking mechanism for dirty data blocks. Experimental evaluation demonstrates the efficiency and effectiveness of DLSM.

关键词： Data transfer Switches Virtual machine monitors Convergence Linux Kernel Bandwidth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共115页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：