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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

414 篇 会议
132 篇 期刊文献
11 册 图书

馆藏范围

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

日期分布

学科分类号

295 篇 工学
- 228 篇 计算机科学与技术...
- 162 篇 软件工程
- 59 篇 信息与通信工程
- 43 篇 控制科学与工程
- 29 篇 电气工程
- 19 篇 生物工程
- 18 篇 机械工程
- 16 篇 动力工程及工程热...
- 15 篇 电子科学与技术（可...
- 9 篇 力学（可授工学、理...
- 9 篇 环境科学与工程（可...
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 6 篇 交通运输工程
- 6 篇 网络空间安全
- 5 篇 农业工程
113 篇 理学
- 74 篇 数学
- 28 篇 系统科学
- 21 篇 生物学
- 20 篇 统计学（可授理学、...
- 15 篇 物理学
- 10 篇 化学
83 篇 管理学
- 60 篇 管理科学与工程(可...
- 36 篇 工商管理
- 28 篇 图书情报与档案管...
7 篇 经济学
- 7 篇 应用经济学
7 篇 法学
- 5 篇 社会学
6 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
5 篇 农学
- 5 篇 作物学
4 篇 教育学
1 篇 文学

主题

61 篇 computer science
47 篇 grid computing
44 篇 laboratories
39 篇 distributed comp...
31 篇 application soft...
28 篇 computational mo...
27 篇 resource managem...
27 篇 cloud computing
26 篇 quality of servi...
24 篇 concurrent compu...
24 篇 processor schedu...
23 篇 computer network...
21 篇 computer archite...
18 篇 peer to peer com...
17 篇 software enginee...
17 篇 bandwidth
16 篇 scheduling algor...
15 篇 algorithm design...
15 篇 middleware
15 篇 delay

机构

27 篇 grid computing a...
10 篇 institute of par...
10 篇 science and tech...
9 篇 college of compu...
9 篇 cloud computing ...
9 篇 national laborat...
7 篇 grid computing a...
7 篇 ieee
7 篇 department of co...
7 篇 parallel and dis...
6 篇 parallel and dis...
6 篇 intelligent dist...
6 篇 service oriented...
5 篇 school of electr...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 national laborat...
5 篇 distributed syst...
4 篇 science and tech...
4 篇 key laboratory o...

作者

54 篇 rajkumar buyya
20 篇 buyya rajkumar
12 篇 zhigang luo
12 篇 li kuan-ching
11 篇 naiyang guan
11 篇 chen haibo
11 篇 yang chao-tung
10 篇 ismail leila
10 篇 fei-yue wang
10 篇 materwala huned
10 篇 a. boukerche
8 篇 dustdar schahram
8 篇 kuan-ching li
8 篇 xuhui huang
7 篇 liu jie
7 篇 wang zhaoguo
6 篇 xiang zhang
6 篇 hangjun zhou
6 篇 li jinyang
6 篇 chao-tung yang

语言

544 篇 英文
6 篇 中文
5 篇 其他
1 篇 法文
1 篇 葡萄牙文

检索条件"机构=Parallel and Distributed Systems Laboratory Department of Computer Science"

共 557 条记录，以下是281-290 订阅

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

详细简洁

排序：

An Energy-Efficient Scheduling Algorithm for Sporadic Real-Time Tasks in Multiprocessor systems

An Energy-Efficient Scheduling Algorithm for Sporadic Real-T...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Dong-Song Zhang Fang-Yuan Chen Hong-Hua Li Shi-Yao Jin De-Ke Guo National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China School of Computing Science Simon Fraser University Burnaby BC Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha China

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads.

关键词： Real time systems Scheduling algorithm Time frequency analysis Scheduling Heuristic algorithms Power demand

来源：评论

学校读者我要写书评

暂无评论

Public and private BitTorrent communities: A measurement study 9

Public and private BitTorrent communities: A measurement stu...

引用

9th International Workshop on Peer-to-Peer systems, IPTPS 2010

作者： Meulpolder, M. D'Acunto, L. Capotă, M. Wojciechowski, M. Pouwelse, J.A. Epema, D.H.J. Sips, H.J. Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

BitTorrent communities, both public and private, are immensely popular in the Internet, with tens of millions of users simultaneously active at any given moment. Public and private BitTorrent communities are managed in different ways - for instance, some private communities enforce sharing ratios, have strict rules for content management, have a certain level of community oversight, and maintain a strong sense of exclusiveness. In this paper, we present the results of extensive measurements of more than half a million peers in five communities, ranging from highly popular and well-known public communities to elite private communities that can only be joined by invitation. We observe that the performance experienced by downloaders in the private communities is by far superior to the performance in the public communities, and we observe significant differences in connectability, seeder/leecher ratio, and seeding duration. Based on our results, we conjecture that when effective ratio enforcement mechanisms are in place, BitTorrent's tit-for-tat mechanism is hardly influential anymore. Our multi-community, multi-swarm measurements are significantly broader and more extensive than any earlier measurement study on BitTorrent. © IPTPS *** right reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving accuracy and coverage in an internet-deployed reputation mechanism

Improving accuracy and coverage in an internet-deployed repu...

引用

2010 IEEE 10th International Conference on Peer-to-Peer Computing, P2P 2010

作者： Delaviz, Rahim Andrade, Nazareno Pouwelse, Johan A. Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

ISBN: (纸本)9781424471416

P2P systems can benefit from reputation mechanisms to promote cooperation and help peers to identify good service providers. However, in spite of a large number of proposed reputation mechanisms, few have been investigated in real situations. BarterCast is a distributed reputation mechanism used by our Internet-deployed Bittorent-based file-sharing client Tribler. In BarterCast, each peer uses messages received from other peers to build a weighted, directed subjective graph that represents the upload and download activity in the system. A peer calculates the reputations of other peers by applying the maxflow algorithm to its subjective graph. For efficiency reasons, only paths of at most two hops are considered in this calculation. In this paper, we identify and assess three potential modifications to BarterCast for improving its accuracy and coverage (fraction of peers for which a reputation value can be computed). First, a peer executes maxflow from the perspective of the node with the highest betweenness centrality in its subjective graph instead of itself. Second, we assume a gossiping protocol that gives each peer complete information about upload and download activities in the system, and third, we lift the path length restriction in the maxflow algorithm. To assess these modifications, we crawl the Tribler network and collect the upload and download actions of the peers for three months. We apply BarterCast with and without the modifications on the collected data and measure accuracy and coverage. ©2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

17th IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2010

作者： Andreica, Mugurel Ionuţ Ţâpuş, Nicolae Pouwelse, Johan Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

ISBN: (纸本)9781424467259

LEDBAT is a new congestion control algorithm which was proposed in an IETF draft in March 2009. LEDBAT's goal is to provide a less-than-best-effort data transport service, i.e. a LEDBAT flow should back-off in the presence of other competing flows (TCP flows in particular). Because of its intended friendliness to competing flows, LEDBAT has already been implemented in the popular Bittorrent client uTorrent. In this paper we present performance evaluation results for our Python implementation of LEDBAT. We ran tests both in emulated networks as well as in real world networks. One of the tests involved approximately 300 volunteers spread throughout the world.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

AESSE: A cold-boot resistant implementation of AES

AESSE: A cold-boot resistant implementation of AES

引用

3rd European Workshop on System Security, EUROSEC'10

作者： Muller, Tilo Dewald, Andreas Freiling, Felix C. RWTH Aachen University Computer Science Department Germany University of Mannheim Laboratory for Dependable Distributed Systems Germany

ISBN: (纸本)9781450300599

Cold boot attacks exploit the fact that memory contents fade with time and that most of them can be retrieved after a short power-down (reboot). These attacks aim at retrieving encryption keys from memory to thwart disk drive encryption. We present a method to implement disk drive encryption that is resistant to cold boot attacks. More specifically, we implemented AES and integrated it into the Linux kernel in such a way that neither the secret key nor any parts of it leave the processor. To achieve this, we used the SSE (streaming SIMD extensions) available in modern Intel processors in a non-standard way. We show that the performance penalty is acceptable and present a brief security analysis of the system. Copyright 2010 ACM.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

2010 IEEE 18th International Workshop on Quality of Service, IWQoS 2010

作者： Chen, Fajun Liu, Jiangchuan Li, Zongpeng Wang, Yijie Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer National University of Defense Technology China School of Computing Science Simon Fraser University Canada Department of Computer Science University of Caglary Canada

ISBN: (纸本)9781424459889

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Improving Accuracy and Coverage in an Internet-Deployed Reputation Mechanism

Improving Accuracy and Coverage in an Internet-Deployed Repu...

引用

International Conference on Peer-to-Peer Computing

作者： R. Delaviz N. Andrade J. A. Pouwelse Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

关键词： Peer to peer computing Accuracy Crawlers Protocols Testing Training Measurement

来源：评论

学校读者我要写书评

暂无评论

Large-scale network topology generation for emulation environment

Large-scale network topology generation for emulation enviro...

引用

1st International Conference on Networking and distributed Computing, ICNDC 2010

作者： Kuang, Xiao-Hui Huang, Min-Huan Che, Yong-Gang Jin, Li Fei, Xu National Key Laboratory of Science and Technology on Information System Security Beijing Institute of System and Engineering Beijing China Department of Computer Science and Technology Tsinghua University Beijing China National Laboratory for Parallel and Distributed Process National University of Defense Technology Changsha China

ISBN: (纸本)9780769542072

Network emulation environment is great importance to the research of network protocols, applications and security mechanism. Large-scale network topology generation is one of key technologies to construct network emulation environment. In this paper, a new large-scale network topology generation framework called LSNTGF is proposed, which divides the network topology into three hierarchies: AS, router and terminal node. It contains the assignment mechanism to bandwidth of each link and IP address of each node. The framework is evaluate by implementation, and the result illustrate it is efficient to network emulation environment for network protocols and security research. © 2010 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

A taxonomy of autonomic application management in grids

A taxonomy of autonomic application management in grids

引用

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

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Cloud Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9780769543079

In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the similarities and differences of state-of-the-art technologies utilized in autonomic application management from the perspective of Grid computing, but also identifies the areas that require further research initiatives. © 2010 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR

作者： Mugurel Ionuţ Andreica Nicolae Ţăpuş Johan Pouwelse Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

关键词： Peer to peer computing Testing Control systems Delay estimation Delay effects Streaming media computer science Radio access networks Performance evaluation Time measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：