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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

381 篇 会议
156 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

323 篇 工学
- 246 篇 计算机科学与技术...
- 197 篇 软件工程
- 67 篇 信息与通信工程
- 52 篇 控制科学与工程
- 37 篇 生物工程
- 29 篇 电子科学与技术（可...
- 25 篇 机械工程
- 22 篇 电气工程
- 12 篇 化学工程与技术
- 10 篇 力学（可授工学、理...
- 9 篇 仪器科学与技术
- 9 篇 动力工程及工程热...
- 8 篇 农业工程
- 7 篇 土木工程
- 7 篇 交通运输工程
- 7 篇 网络空间安全
- 6 篇 光学工程
- 6 篇 核科学与技术
- 6 篇 生物医学工程（可授...
146 篇 理学
- 83 篇 数学
- 37 篇 生物学
- 35 篇 物理学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 化学
83 篇 管理学
- 53 篇 管理科学与工程(可...
- 31 篇 图书情报与档案管...
- 10 篇 工商管理
9 篇 法学
- 8 篇 社会学
8 篇 农学
- 8 篇 作物学
6 篇 医学
5 篇 经济学
3 篇 教育学
2 篇 文学
2 篇 军事学
2 篇 艺术学

主题

24 篇 training
19 篇 computational mo...
18 篇 deep learning
17 篇 feature extracti...
15 篇 computer archite...
15 篇 neural networks
14 篇 benchmark testin...
14 篇 semantics
14 篇 algorithm design...
14 篇 cloud computing
13 篇 task analysis
13 篇 servers
12 篇 accuracy
12 篇 distributed data...
11 篇 distributed proc...
11 篇 machine learning
11 篇 clustering algor...
11 篇 kernel
10 篇 scalability
10 篇 laboratories

机构

134 篇 science and tech...
62 篇 college of compu...
36 篇 science and tech...
23 篇 national laborat...
22 篇 science and tech...
16 篇 science and tech...
14 篇 national laborat...
13 篇 school of comput...
13 篇 laboratory of di...
12 篇 national key lab...
11 篇 national key lab...
10 篇 college of compu...
9 篇 national laborat...
8 篇 school of comput...
8 篇 college of compu...
8 篇 college of scien...
8 篇 national key lab...
8 篇 national key lab...
7 篇 national univers...
7 篇 xiangjiang lab

作者

35 篇 liu jie
32 篇 jie liu
24 篇 yijie wang
20 篇 dou yong
20 篇 peng yuxing
18 篇 wang yijie
17 篇 zhigang luo
15 篇 yuxing peng
15 篇 dongsheng li
15 篇 qinglin wang
15 篇 huaimin wang
15 篇 qiao peng
14 篇 naiyang guan
14 篇 wang huaimin
13 篇 li dongsheng
13 篇 yong dou
13 篇 zuocheng xing
12 篇 wang qinglin
11 篇 chen xinhai
11 篇 chunye gong

语言

509 篇 英文
26 篇 中文
4 篇 其他

检索条件"机构=Science and Technology on Parallel and Distributed Laboratory"

共 539 条记录，以下是311-320 订阅

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

详细简洁

排序：

parallel pipeline implementation for moving objects detection in traffic video analysis on a heterogeneous platform 4th

Parallel pipeline implementation for moving objects detectio...

引用

4th International Conference on Computer Engineering and Networks, CENet2014

作者： Li, Teng Dou, Yong Jiang, Jingfei Qiao, Peng Department of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319111032

Moving objects detection is important in traffic video analysis, and many algorithms are being increasingly applied to moving objects detection. Most of these algorithms are time-consuming and cannot satisfy real-time demand in traffic video analysis by using a conventional central processing unit (CPU) sequential method. The emergence of the graphics processing unit (GPU) and multi-core CPU provides a method to accelerate the aforementioned algorithms to meet demand. In this study, we provide a GPU-accelerated implementation of the background subtraction algorithm and the morphological operation algorithm. Then, the connected component labeling algorithm is parallelized on a multi-core CPU with Open Multi-Processing (OpenMP). Furthermore, parallel pipeline implementation on a heterogeneous platform is proposed by integrating the aforementioned algorithms. Experimental results show that the proposed implementation achieves a significant speedup of up to 5×, compared with sequential implementation on a CPU. © Springer International Publishing Switzerland 2015.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Deadline-oriented task scheduling for mapreduce environments 15th

Deadline-oriented task scheduling for mapreduce environments

引用

15th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2015

作者： Hu, Minghao Wang, Changjian You, Pengfei Huang, Zhen Peng, Yuxing National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410072 China

ISBN: (纸本)9783319271217

To provide timely results for ‘Big Data Analytics’, it is crucial to satisfy deadline requirements for MapReduce jobs in production environments. In this paper, we propose a deadline-oriented task scheduling approach, named Dart, to meet the given deadline and maximize the input size if only part of the dataset can be processed before the time limit. Dart uses an iterative estimation method which is based on both historical data and job running status to precisely estimate the realtime job completion time. By comparing the estimated time with the deadline constraint, a YARN-based task scheduler dynamically decides whether continuing or terminating the map *** have validated our approach using workloads from OpenCloud and Facebook on a cluster of 60 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximal data volumes even when the deadline is set to be extremely small and limited resources are allocated. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Partial clones for stragglers in MapReduce

Partial clones for stragglers in MapReduce

引用

International Conference of Young Computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Li, Jia Wang, Changjian Li, Dongsheng Huang, Zhen National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783662462478

Stragglers can temporize jobs and reduce cluster efficiency seriously. Many researches have been contributed to the solution, such as Blacklist[8], speculative execution[1, 6], Dolly[8]. In this paper, we put forward a new approach for mitigating stragglers in MapReduce, name Hummer. It starts task clones only for high-risk delaying tasks. Related experiments have been carried and results show that it can decrease the job delaying risk with fewer resources consumption. For small jobs, Hummer also improves job completion time by 48% and 10% compared to LATE and Dolly. © Springer-Verlag Berlin Heidelberg 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Software ranking and analysis based on mining market requirements and characteristics 15

Software ranking and analysis based on mining market require...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Liu, Bingxun Yin, Gang Wang, Tao Zhang, Fang Wang, Huaimin National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

As the rapid growth of open source software, how to choose software from many alternatives becomes a great challenge. Traditional ranking approaches mainly focus on the characteristics of the software themselves, such as qualities, security, reliable and so on. In this paper we investigate the market demands for software engineers, and propose a novel approach for ranking software by analyzing the market requirements for special software. At the same time we conclude the characteristics of software advertisements and analyze the reasons that why these situations emerge and tendency of software market requirements. As industries always need to balance several different factors for selecting software, the market demands can be a good indicator for ranking software and software evaluating. This paper provides quite a different perspective and some interesting inferences on software market requirements, and it can be a valuable supplement for traditional ranking methods, as well as software evaluating. © 2015 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Locality Protected Dynamic Cache Allocation Scheme on GPUs

Locality Protected Dynamic Cache Allocation Scheme on GPUs

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yang Zhang Zuocheng Xing Li Zhou Chunsheng Zhu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Electronic Science and Engineering National University of Defense Technology Changsha China Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781509032068

As we are approaching the exascale era in supercomputing, designing a balanced computer system with powerful computing ability and low energy consumption becomes increasingly important. GPU is a widely used accelerator in most recently applied supercomputers. It adopts massive multithreads to hide long latency and has high energy efficiency. In contrast to its strong computing power, GPUs have few on-chip resources with several MB of fast on-chip memory storage per SM (Streaming Multiprocessors). GPU caches exhibit poor efficiency due to the mismatch of the throughput-oriented execution model and its cache hierarchy design. Since the severe deficiency in on-chip memory, the benefit of high computing capacity of GPUs is pulled down by the poor cache performance dramatically, which limits system performance and energy-efficiency. In this paper, we put forward a locality protected scheme to make full use of the data locality based on the fixed capacity. We present a Locality Protected method based on instruction PC (LPP) to promote GPU performance. Firstly, we use a PC-based collector to collect the reuse information of each cache line. After getting the dynamic reuse information of the cache line, we take an intelligent cache allocation unit (ICAU) which coordinates the reuse information with LRU (Least Recently Used) replacement policy to find out the cache line with the least locality for eviction. The results show that LPP provides an up to 17.8% speedup and an average of 5.5% improvement over the baseline method.

关键词： Graphics processing units System-on-chip Computer architecture Instruction sets Resource management Optimization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A survey on concepts and the state of the art of functional programming languages

A survey on concepts and the state of the art of functional ...

引用

International Symposium on Systems and Computer technology, ISSCT 2014

作者： Jian, Song-lei Lu, Kai Wang, Xiao-ping 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

ISBN: (纸本)9781138028722

Functional programming languages have a long history and receive more and more attention today. The paper focuses on the development of functional languages and aims to introduce the concepts, such as higher-order functions, lazy evaluation, data type, and pattern matching. We also review the evolution of functional programming languages from lambda calculus, Lisp to Haskell. Based on the analysis of leading papers published on ACM conferences, we survey 5 active research areas: monads, verification, type system, data parallelism, and application of functional programming languages and discuss the limitation of functional programming languages. © 2015 Taylor & Francis Group, London.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Poster: Segmentation Based Online Performance Problem Diagnosis 37

Poster: Segmentation Based Online Performance Problem Diagno...

引用

37th IEEE/ACM International Conference on Software Engineering, ICSE 2015

作者： Zhou, Jingwen Chen, Zhenbang Wang, Ji 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

ISBN: (纸本)9781479919345

Currently, the performance problems of software systems gets more and more attentions. Among various diagnosis methods based on system traces, principal component analysis (PCA) based methods are widely used due to the high accuracy of the diagnosis results and requiring no specific domain knowledge. However, according to our experiments, we have validated several shortcomings existed in PCA-based methods, including requiring traces with a same call sequence, inefficiency when the traces are long, and missing performance problems. To cope with these issues, we introduce a segmentation based online diagnosis method in this poster. © 2015 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Tree-structured bloom filters for joint optimization of false positive probability and transmission bandwidth

Tree-structured bloom filters for joint optimization of fals...

引用

ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2015

作者： Fu, Yongquan Biersack, Ernst Science and Technology Laboratory of Parallel and Distributed Processing School of Computer National Univ. of Defense Technology China Www.e-biersack.eu France

ISBN: (纸本)9781450334860

Bloom filters are frequently used to perform set queries that test the existence of some items. However, Bloom filters face a dilemma: the transmission bandwidth and the accuracy cannot be optimized simultaneously. This dilemma is particularly severe for transmitting Bloom filters to remote nodes when the network bandwidth is limited. We propose a novel Bloom filter BloomTree that consists of a tree-structured organization of smaller Bloom filters, each one using a set of independent hash functions. BloomTree spreads items across levels that are compressed to reduce the transmission bandwidth need. We investigate in detail under which conditions BloomTree performs better than the compressed Bloom filter and the standard Bloom filter. © Copyright 2015 ACM.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Maximizing Uniform Multicast Throughput in Multi-Channel Dense Wireless Sensor Networks

Maximizing Uniform Multicast Throughput in Multi-Channel Den...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Xianlong Jiao Guirong Chen Xiaodong Wang Yuli Chen Li Yang College of Information System and Management National University of Defense Technology Changsha Information and Navigation College Air Force Engineering University Xi'an Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Chongqing Guanyinqiao Elementary School Chongqing Chongqing Liangjiangxinqu Renhe Experimental School Chongqing

ISBN: (纸本)9781509056972

This paper investigates the problem of maximizing uniform multicast throughput (MUMT) for multi-channel dense wireless sensor networks, where all nodes locate within one-hop transmission range and can communicate with each other on multiple orthogonal channels. This kind of networks show wide application in the real world, and maximizing uniform multicast throughput for these networks is worth deep studying. Previous researches have proved MUMT problem is NP-hard. However, previous researches are either hard to implement, or use too many relay nodes to complete the multicast task, and thus incur high overhead or poor performance. To efficiently solve MUMT problem, we adopt the concept of the maximum independent set with the size constraint, and present one novel Single-Broadcast based Multicast algorithm called SBM based on the concept. We prove that SBM algorithm achieves a constant ratio to the theoretical throughput upper bound. Extensive experimental results demonstrate that, SBM performs better than existing work in terms of both the uniform multicast throughput and the total number of transmissions.

关键词： Throughput Wireless sensor networks Approximation algorithms Schedules Data communication Algorithm design and analysis Relays

来源：评论

学校读者我要写书评

暂无评论

Accelerating FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture

Accelerating FDTD simulation of microwave pulse coupling int...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2015

作者： Wang, Qinglin Liu, Jie Cui, Xiantao Fu, Guitao Gong, Chunye Xing, Zuocheng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China School of Computer Science National University of Defense Technology Changsha410073 China Beijing Satellite Navigation Center Beijing100094 China

ISBN: (纸本)9781467377881

The coupling of microwaves into apertures plays an important part in many electromagnetic physics and engineering fields. When the width of apertures is very small, Finite Difference Time Domain (FDTD) simulation of the coupling is very time-consuming. As a many-core architecture, the Intel's Many Integrated Core (MIC) architecture owns 512-bit vector units and more than 200 threads. In this paper, we parallelize FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture. In the implementation, the parallel programming model OpenMP is used to exploit thread parallelism while loop unrolling and SIMD intrinsic functions are utilized to accomplish vectorization. Compared with the serial version on Intel Xeon E5-2670 CPU, the implementation on the MIC coprocessor including 57 cores obtains a speedup of 11.57 times. The experiment results also demonstrate that the parallelization has good scalability in performance. Additionally, how binding relationship between OpenMP threads and hardware threads in MIC influences performance is also reported. © 2015 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共54页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：