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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,748 篇 会议
29 册 图书
27 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,390 篇 工学
- 1,274 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
102 篇 distributed comp...
74 篇 parallel process...
60 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 grid computing
38 篇 distributed data...
37 篇 parallel program...
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
11 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,765 篇 英文
21 篇 其他
13 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是901-910 订阅

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

详细简洁

排序：

Experimental Evaluation of Opportunistic Spectrum Access in distributed Cognitive Radio Networks

Experimental Evaluation of Opportunistic Spectrum Access in ...

引用

8th IEEE international Wireless Communications and Mobile computing conference (IWCMC)

作者： Khattab, Ahmed Perkins, Dmitri Bayoumi, Magdy A. Univ Louisiana Lafayette CACS Lafayette LA USA

ISBN: (纸本)9781457713798

Opportunistic Spectrum Access (OSA) is foreseen as the future of wireless communications. However, today's cognitive radio technologies lag far behind the OSA goals and do not allow for the applicability of exiting theoretical distributed OSA techniques. In this paper, we experimentally demonstrate the ability of realizing OSA despite the practical limitations of existing transceiver technologies. We use the general purpose Wireless open-Access Research Platform (WARP) to instrument the implementation of fundamental OSA functionalities. then we implement a suite of OSA schemes using this implementation framework. Our experiments show that suboptimal but practical OSA approaches such as random spectrum sensing and non-greedy access achieve superior performance given cognitive radios with limited capabilities compared to OSA approaches that are optimized for fully-capable cognitive radio networks (e. g., with wide-band sensing capability and adopt winner-takes-all access relying on network-wide coordination mechanisms).

关键词： cognitive radio networks opportunistic spectrum management performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a Massively parallel ESB-Oriented Architecture

Performance Evaluation of a Massively Parallel ESB-Oriented ...

引用

5th IEEE international conference on Service-Oriented computing and applications (SOCA)

作者： Benosman, Ridha Albrieux, Yves Barkaoui, Kamel CNAM CEDRIC Lab F-75141 Paris France

ISBN: (纸本)9781467347754;9781467347730

Enterprise Service Bus (ESB) is an SOA-based software architecture for business application integration in distributed and heterogeneous environments. Most of open-source or commercial solutions offer the same set of basic services such as message transformation, message routing, security, etc... however, none of them take advantage of the multicore/multiprocessor technologies which make possible the massively parallel processing. this work concerns performance evaluation of a massively parallel ESB oriented architecture (denoted MPAB). After a brief description of its main components, we present the results of this evaluation based on operational analysis.

关键词： ESB-Oriented Architecture Performance Evaluation Multithreading Massively parallel Processing

来源：评论

学校读者我要写书评

暂无评论

Network Load Analysis and Provisioning of MapReduce applications

Network Load Analysis and Provisioning of MapReduce Applicat...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Rizvandi, Nikzad Babaii Taheri, Javid Moraveji, Reza Zomaya, Albert Y. Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia

ISBN: (纸本)9780769548791

In this paper, we study the dependency between MapReduce configuration parameters and network load of fixed-size MapReduce jobs during the shuffle phase;then we propose an analytical method to model this dependency. Our approach consists of three key phases: profiling, modeling, and prediction. In the first stage, an application is run several times with different sets of MapReduce configuration parameters (here number of map tasks and number of reduce tasks) to profile the network load of an application in the shuffle phase on a given cluster. then, the relation between these parameters and the network load is modeled by multivariate linear regression. For evaluation, three applications (WordCount, Exim Mainlog parsing, and TeraSort) are utilized to evaluate our technique on a 5-node MapReduce private cluster.

关键词： MapReduce Configuration parameters network load analysis provisioning multivariate linear regression number of map tasks number of reduce tasks

来源：评论

学校读者我要写书评

暂无评论

A Synchronization-Induced Checkpoint Protocol for Group-Synchronous parallel Programs

A Synchronization-Induced Checkpoint Protocol for Group-Sync...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Wei, Zunce Goswami, Dhrubajyoti Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada

ISBN: (纸本)9780769548791

Group checkpointing is a fix between global checkpointing and log-based recovery. It features both reduced runtime overhead and localized recovery effect for improving the fault-tolerance performance of large-scale distributed systems. However, parallel programs cannot efficiently benefit from this strategy, as they often involve synchronous or semi-synchronous interactions that incur extra idling delays between processes as well as between process groups. this paper presents an analytical study on such delays and the corresponding delay optimization strategies. Observing that certain parallel programs exhibit patterns of "synchronization groups", we develop a Synchronization-Induced Checkpoint protocol that manages checkpoints around such groups. the protocol keeps advantages of ordinary group checkpointing, and meanwhile minimizes the costs of synchronization-induced delays. We also broadly categorize the known synchronization patterns and establish their relations with suitable checkpoint strategies for parallel programs.

关键词： Fault tolerance checkpoint and recovery group checkpoint delay dependency synchronization group synchronization-induced checkpoint

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Load Balancing Approach for parallel Search-Tree Optimization

A Decentralized Load Balancing Approach for Parallel Search-...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Abu-Khzam, F. N. Mouawad, A. E. Lebanese Amer Univ Sch Arts & Sci Dept Comp Sci & Math Beirut Lebanon Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9780769548791

Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that targets highly scalable parallel exact algorithms for NP-hard graph problems. We tackle the problems of efficiency and scalability by combining a fully decentralized dynamic load balancing strategy with special implementation techniques for exact graph algorithms. As a case-study, we use our framework to implement parallel algorithms for the VERTEX COVER and DOMINATING SET problems. We present experimental results that show notable improved running times on all types of input instances.

关键词： parallel Algorithms Exact Algorithms Vertex Cover Dominating Set Dynamic Load Balancing Recursive Backtracking

来源：评论

学校读者我要写书评

暂无评论

Study on Quantum parallel Processing by Adiabatic Quantum Computation in Bernstein-Vazirani Problem

Study on Quantum Parallel Processing by Adiabatic Quantum Co...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Nakayama, Shigeru Gang, Peng Iimura, Ichiro Kagoshima Univ Dept Inf Sci & Bio Eng Kagoshima 8900065 Japan Huizhou Univ Dept Comp Sci Huizhou Peoples R China Prefectural Univ Kumamoto Dept Adm Kumamoto Japan

ISBN: (纸本)9780769548791

Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.

关键词： quantum parallel processing quantum algorithm adiabatic quantum computation Bernstein-Vazirani problem combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

Statistical performance tuning of parallel Monte Carlo ocean color simulations

Statistical performance tuning of parallel Monte Carlo ocean...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Kajiyama, Tamito D'Alimonte, Davide Cunha, Jose C. Univ Nova Lisboa CITI Dept Informat FCT P-1200 Lisbon Portugal Univ Nova Lisboa CENTRIA Dept Informat FCT Lisbon Portugal

ISBN: (纸本)9780769548791

Statistical performance tuning of a parallel Monte Carlo (MC) radiative transfer code for ocean color (OC) applications is presented. A low observed-to-peak performance ratio due to highly sparse computations is compensated by online and offline tuning techniques based on a statistical indicator of products accuracy. Run-time adaptive control employs the accuracy indicator to set up two complementary tuning criteria: one general to MC computations and the other specific to OC applications. the same accuracy indicator is also used for pre-execution tuning of a threshold parameter. Numerical simulations of real case scenarios showed that the proposed methods consistently led to faster runs, while satisfying application accuracy requirements. Specifically, speed-ups range from 2.17 to 7.44 times when compared with the un-optimized version of the MC code. the applied techniques are orthogonal to parallelization, so that the reported performance gains are further amplified by parallel speed-ups.

关键词： High-performance computing Adaptive computing Problem-solving environment

来源：评论

学校读者我要写书评

暂无评论

Can We Make It Faster? Efficient May-Happen-in-parallel Analysis Revisited

Can We Make It Faster? Efficient May-Happen-in-Parallel Anal...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Chen, Congming Huo, Wei Li, Lung Feng, Xiaobing Xing, Kai Chinese Acad Sci State Key Lab Comp Architecture Beijing Peoples R China Chinese Acad Sci Grad Univ Beijing Peoples R China Univ Sci & Technol China Sch Comp Sci Anhui Peoples R China

ISBN: (纸本)9780769548791

May-Happen-in-parallel (MHP) analysis is a very important and fundamental mechanism to facilitate concurrent program analysis, optimization and even concurrency bug detection. However, the inefficiency in its design and implementation keeps MHP analysis away from being practical and effective. In this paper, we investigate the state-of-art of iterative data flow based (IDFB) MHP analysis and propose a new design and corresponding systematic implementation. Specifically, we address the most severe efficiency problems in node process order of the work-list in the original approach, and resolve them in our design and implementation by using the concept of parallel level to avoid redundant node visits. Our intensive experimental study shows that the proposed design and implementation have a relative speed up of 29.02x compared with the original implementation, moreover, it achieves a relative speed up of 10.00x comparing to the state-of-art of non-IDFB approach which is claimed to be more efficient than the original IDFB approach. Our design and implementation are capable of achieving an order of magnitude efficiency improvement comparing to both IDFB and non-IDFB approaches.

关键词： Concurrent Program Control Flow Analysis Conservative Efficiency Precision

来源：评论

学校读者我要写书评

暂无评论

Breaking weak 1024-bit RSA keys with CUDA

Breaking weak 1024-bit RSA keys with CUDA

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Scharfglass, Kerry Weng, Darrin White, Joseph Lupo, Christopher Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA

ISBN: (纸本)9780769548791

An exploit involving the greatest common divisor (GCD) of RSA moduli was recently discovered [1]. this paper presents a tool that can efficiently and completely compare a large number of 1024-bit RSA public keys, and identify any keys that are susceptible to this weakness. NVIDIA's graphics processing units (GPU) and the CUDA massively-parallel programming model are powerful tools that can be used to accelerate this tool. Our method using CUDA has a measured performance speedup of 27.5 compared to a sequential CPU implementation, making it a more practical method to compare large sets of keys. A computation for finding GCDs between 200,000 keys, i.e., approximately 20 billion comparisons, was completed in 113 minutes, the equivalent of approximately 2.9 million 1024-bit GCD comparisons per second.

关键词： CUDA RSA greatest common divisor parallel computation

来源：评论

学校读者我要写书评

暂无评论

Improving Application Availability in Wireless Sensor Networks with Energy-Harvesting Capability

Improving Application Availability in Wireless Sensor Networ...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Rentifis, Ilias Tziritas, Nikos Lampsas, Petros Lalis, Spyros Loukopoulos, thanasis Univ Thessaly Comp & Commun Engn Dept Thessaloniki Greece Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China Technol Educ Inst Lamia Informat & Comp Technol Dept Lamia Greece

ISBN: (纸本)9780769548791

We assume a wireless sensor and actuator network with nodes that can harvest energy from the environment, and an application deployed in this network, which is structured as a set of cooperating mobile components that can be placed on any node that provides the required sensor and actuator resources. We propose algorithms that take into account the energy consumption rate of agents as well as energy reserves and harvesting rate of nodes, and decide about the migration of agents in order to improve application availability. Initial evaluation results via simulation show that application availability can be greatly improved compared to having a static application placement.

关键词： placement algorithms energy-awareness mobile agents wireless sensor networks distributed systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 87 88 89 90 91 92 93 94 95 96 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：