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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,713 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

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

共 1767 条记录，以下是861-870 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Evaluating the performance of a parallel multiobjective artificial bee colony algorithm for inferring phylogenies on multicore architectures

Evaluating the performance of a parallel multiobjective arti...

引用

2012 10th IEEE international Symposium on parallel and distributed Processing with applications, ISPA 2012

作者： Santander-Jiménez, Sergio Vega-Rodríguez, Miguel A. Gómez-Pulido, Juan A. Sánchez-Pérez, Juan M. University of Extremadura Department of Technologies of Computers and Communications ARCO Research Group 10003. Cáceres Spain

ISBN: (纸本)9780769547015

A wide variety of optimization problems requires the combination of Bioinspired and parallel computing to address the complexity needed to get optimal solutions in reduced times. the multicore era allows the researcher to exploit modern arqitectures to resolve these NP-Hard problems. Inferring phylogenetic trees which describe a hypothesis of the evolution of species is a well-known example of this kind of problems. As the space of possible tree topologies increases exponentially with the number of species, exhaustive searches cannot be applied. Also, additional difficulties arise when we must consider simultaneously multiple optimality measures to resolve the problem. In this paper, we report a performance study on multicore machines of a parallel multiobjective adaptation of the Artificial Bee Colony algorithm for inferring phylogenies according to the maximum parsimony and maximum likelihood criteria. Experimental results reveal that our proposal can improve other approaches based on advanced High Performance computing techniques on large data sets. © 2012 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive computation offloading from mobile devices into the cloud

Adaptive computation offloading from mobile devices into the...

引用

2012 10th IEEE international Symposium on parallel and distributed Processing with applications, ISPA 2012

作者： Kovachev, Dejan Yu, Tian Klamma, Ralf Information Systems and Database Technologies RWTH Aachen University Ahornstr. 55 52056 Aachen Germany

ISBN: (纸本)9780769547015

the inherently limited processing power and battery lifetime of mobile phones hinder the possible execution of computationally intensive applications like content-based video analysis or 3D modeling. Offloading of computationally intensive application parts from the mobile platform into a remote cloud infrastructure or nearby idle computers addresses this problem. this paper presents our Mobile Augmentation Cloud Services (MACS) middleware which enables adaptive extension of Android application execution from a mobile client into the cloud. applications are developed by using the standard Android development pattern. the middleware does the heavy lifting of adaptive application partitioning, resource monitoring and computation offloading. these elastic mobile applications can run as usual mobile application, but they can also reach transparently remote computing resources. Two prototype applications using the MACS middleware demonstrate the benefits of the approach. the evaluation shows that applications, which involve complicated algorithms and large computations, can benefit from offloading with around 95\% energy savings and significant performance gains compared to local execution only. © 2012 IEEE.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Java hybrid compiler for shared memory parallel programming

A Java hybrid compiler for shared memory parallel programmin...

引用

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

作者： Senghor, Abdourahmane Konate, Karim Cheikh Anta Diop Univ Dakar Dept Math & Informat Dakar Senegal

ISBN: (纸本)9780769548791

the purpose of this paper is to design and implement a hybrid compiler that combines JOMP's directives with javar's annotations in order to obtain a more performing compiler. this is an original approach and consists of pooling the advantages of those two compilers while fixing some of their issues. However the achievement of this aim is facing the issue of the difference of implementation of these two compilers because JOMP is implemented in Java while javar is implemented in C language. We propose to entirely re-implement javar in Java by using JavaCC. thereafter, we present the implementation of the hybrid compiler. In the experiments, we propose to parallelize the matrix sort program by using this hybrid compiler. the results of experiments and the mathematical demonstration lead us to state that dealing with this hybrid compiler gives performances better or equal to the best one between javar and JOMP.

关键词： JOMP javar JavaCC directive annotation hybrid compiler

来源：评论

学校读者我要写书评

暂无评论

Non-Clairvoyant Assignment of Bag-of-Tasks applications Across Multiple Clouds

Non-Clairvoyant Assignment of Bag-of-Tasks Applications Acro...

引用

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

作者： HoseinyFarahabady, M. Lee, Young Choon Zomaya, Albert Y. Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia

ISBN: (纸本)9780769548791

Bag-of-Tasks applications are often composed of a large number of independent tasks;hence, they can easily scale out. With public clouds, the (dynamic) expansion of resource capacity in private clouds is much facilitated. Clearly, cost efficiently running BoT applications in a multi-cloud environment is of great practical importance. In this paper, we investigate how efficiently multiple clouds can be exploited for running BoT applications and present a fully polynomial time randomized approximation scheme (FPRAS) as a novel task assignment algorithm for BoT applications. the resulting task assignment can be optimized in terms of cost, makespan or the tradeoff between them. the objective function incorporated into our algorithm is devised in the way the optimization objective is tunable based on user preference. Our task assignment decisions are made without any prior knowledge of the processing time of tasks, i.e., non-clairvoyant task assignment. We adopt a Monte Carlo sampling method to estimate unknown task running time. the experimental results shows our algorithm approximates the optimal solution with little overhead.

关键词： Non-clairvoyant task assignment scalability cloud computing Bag of Task application cost efficiency

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 15th IEEE international conference on Computational Science and Engineering, CSE 2012 and 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC 2012

Proceedings - 15th IEEE International Conference on Computat...

引用

15th IEEE international conference on Computational Science and Engineering, CSE 2012 and 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC 2012

ISBN: (纸本)9780769549149

the proceedings contain 93 papers. the topics discussed include: building input adaptive parallel applications: a case study of sparse grid interpolation;a lightweight middleware for developing P2P applications with component and service-based principles;automatic scaling of complex-event processing applications in eucalyptus;DCA: dynamic challenging level adapter for real-time strategy games;a grasp-based heuristic for the project portfolio selection problem;allocation of hard real-time periodic tasks for reliability maximization in distributed systems;automatic clustering assessment through a social tagging system;a new concise representation method of generalized frequent itemsets;parameter sweep and optimization of loosely coupled simulations using the DAKOTA toolkit;implementation of a data-driven workflow management system;and a new approach for indexing powder diffraction data based on dichotomy method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 83 84 85 86 87 88 89 90 91 92 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：