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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是821-830 订阅

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

详细简洁

排序：

Improving Particle Swarm Optimization Algorithm for distributed Sensing and Search

Improving Particle Swarm Optimization Algorithm for Distribu...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Cai, Yi Chen, Zhutian Min, Huaqing S China Univ Technol Sch Software Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9780769550947

distributed coordination is critical for a multi-robot system in collective cleanup task under a dynamic environment. In traditional methods, robots easily drop into premature convergence. In this paper, we propose a swarm-intelligence based algorithm to reduce the expectation time for searching targets and removing. We modify the traditional PSO algorithm with a random factor to tackle premature convergence problem, and it can achieve a significant improvement in multi-robot system. It performs well even in a obstacle environment. the proposed method has been implemented on self-developed simulator for searching task. the simulation results demonstrate the feasibility, robustness, and scalability of our proposed method than previous methods.

关键词： PSO algorithm Swarm robotics Collective cleanup Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

A fully distributed resilient routing scheme for switch-based networks

A fully distributed resilient routing scheme for switch-base...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： thanh Son Pham Carlier, Jacques Lattmann, Joel Lutton, Jean-Luc Nace, Dritan Valeyre, Laurent Orange Lab Issy Les Moulineaux France Univ Technol Compiegne CNRS Lab Heudiasyc UMR 7253 Compiegne France

ISBN: (纸本)9780769550947

this paper proposes a fully distributed scalable resilient routing scheme for virtual networks using switches. the scheme is very easy to implement and does not require global information on the state of the network. Failures are treated purely locally, and the other nodes in the network do not need to know anything about it or to undertake special actions. In contrast to conventional IP routing schemes, each node routes the traffic on the basis of the entering arc and on the destination. We show that this is sufficient for dealing with all single link/node failure situations in the network, assuming that the network is two-link (respectively two-node) connected.

关键词： switching networks telecommunication network routing telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

8th international conference on Advanced Data Mining and applications, ADMA 2012, international Workshop on Social Network Analysis and Mining, SNAM 2012 and international Workshop on Social Media Mining, Retrieval and Recommendation technologies, SMR 2012

8th International Conference on Advanced Data Mining and App...

引用

8th Int. conference on Advanced Data Mining and applications, ADMA 2012, international Workshop on Social Network Analysis and Mining, SNAM 2012 and international Workshop on Social Media Mining, Retrieval and Recommendation technologies, SMR 2012

ISBN: (纸本)9783642416286

the proceedings contain 15 papers. the special focus in this conference is on Advanced Data Mining and applications. the topics include: Towards graph summary and aggregation;a new structure for shortest path query;parallel simrank computing on large scale dataset on map reduce;on-demand interdomain path building protocol;an automatic spell checker framework for Malay language blogs;finding and extracting academic information from conference web pages;a new tag recommendation algorithm and recommender enhancement with data fusion techniques;multi-influences co-existence based independent cascade model;herd behavior analysis based on evolutionary game theory in the decision-making of innovation adoption;informatization in grain circulation of china;effective location-based image retrieval based on geo-tags and visual features;large-screen intelligent display platform for run-time data visualization and a pork traceability framework based on internet of things.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient transactions for parallel data movement

Efficient transactions for parallel data movement

引用

8th parallel Data Storage Workshop, PDSW 2013 - Held in Conjunction with the international conference for High Performance computing, Networking, Storage and Analysis, SC 2013

作者： Lofstead, Jay Dayal, Jai Jimenez, Ivo Maltzahn, Carlos Sandia National Laboratories United States Georgia Institute of Technology United States University of California Santa Cruz CA United States

ISBN: (纸本)9781450325059

the rise of Integrated Application Workflows (IAWs) for processing data prior to storage on persistent media prompts the need to incorporate features that reproduce many of the semantics of persistent storage devices. One such feature is the ability to manage data sets as chunks with natural barriers between different data sets. Towards that end, we need a mechanism to ensure that data moved to an intermediate storage area is both complete and correct before allowing access by other processing components. the Doubly distributed Transactions (D2T) protocol offers such a mechanism. the initial development [9] suffered from scalability limitations and undue requirements on server processes. the current version has addressed these limitations and has demonstrated scalability with low overhead. © 2013 ACM.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A Multi Agent and Dynamic Programming Algorithm for Aeronautical Maintenance Planning

A Multi Agent and Dynamic Programming Algorithm for Aeronaut...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Gargiulo, F. Pascarella, D. Venticinque, Salvatore CIRA Italian Aerosp Res Ctr Soft Comp Lab Capua Italy Univ Naples 2 Dept Informat Engn Aversa Italy

ISBN: (纸本)9780769550947

the competitiveness of the aviation maintenance companies is strictly connected to the security, the quality, the efficiency, the costs and the speed of the maintenance processes. this entails a critical role for the planning of maintenance activities. A specific resource allocation problem for aeronautical maintenance activities is described and a combination of a dynamic programming strategy and an agent-oriented approach for the planning of these activities is proposed. Since the dynamic programming algorithm presented is inherently parallelizable then a multi-agent strategy that allows distributed computing is *** A coordination mechanism guarantees the actions of multiple agents lead to a global solution. Agent-based methods inherently overcome the limitations of centralized load-balancing and they can adaptively execute on dynamic networks of workstations.

关键词： Software agents dynamic programming multi agent system resources constrained planning distributed programming

来源：评论

学校读者我要写书评

暂无评论

2013 8th international conference for Internet Technology and Secured Transactions, ICITST 2013

2013 8th International Conference for Internet Technology an...

引用

2013 8th international conference for Internet Technology and Secured Transactions, ICITST 2013

ISBN: (纸本)9781908320209

the proceedings contain 109 papers. the topics discussed include: considering an elastic scaling model for cloud security;security risk analysis as a service;evaluating security mechanisms implemented on public platform-as-a-service cloud environments case study: windows azure;a framework for assuring the conformance of cloud-based email;characteristics analysis for the Cyberlockers files: study on rapidgator speedyshare and 1 fichier;DA5DCSWS: a distributed architecture for semantic web services discovery and composition;ProtoML: a rule-based validation language for Google protocol buffers;the hybrid model for web services security: access control and information flow control;indirect NFC-login;labeled clustering: a unique method to label unsupervised classes;a workflow for parallel and distributed computing of large-scale genomic data;and Internet unite-and-conquer architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Enhancement of a Scheduling Approach for an Opportunistic Environment

An Enhancement of a Scheduling Approach for an Opportunistic...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Gomes, Eliza Dantas, M. A. R. Univ Fed Santa Catarina Res Lab Distributed Syst LaPeSD Dept Informat & Stat INE BR-88040900 Florianopolis SC Brazil

ISBN: (纸本)9780769550947

Opportunistic grid computing is an interesting paradigm when it is necessary to obtain high performance computing with low cost investment. On the other hand, advance reservation is very useful when QoS and efficient scheduling are desired in a multi-scheduling environment. However, it is not conventional to use advance reservation with opportunistic grid computing due to instability of the environment. In this article, we propose a new advanced reservation approach which offers to a user the possibility to select resources in advance for a future utilization in opportunistic grid computing. therefore, the main goal of this proposal is to offer a best effort feature to a user since these types of environments, it is not possible to provide QoS, because there is no guarantees of resources availability. In addition, we propose the insertion of a mechanism which searches for free time interval and allocates rejected reservations at period of time available closest to the requested. Preliminary results shows the success of the proposal through a case study.

关键词： grid computing quality of service scheduling

来源：评论

学校读者我要写书评

暂无评论

Performance and scalability evaluation of the Ceph parallel file system

Performance and scalability evaluation of the Ceph parallel ...

引用

8th parallel Data Storage Workshop, PDSW 2013 - Held in Conjunction with the international conference for High Performance computing, Networking, Storage and Analysis, SC 2013

作者： Wang, Feiyi Nelson, Mark Oral, Sarp Atchley, Scott Weil, Sage Settlemyer, Bradley W. Caldwell, Blake Hill, Jason Oak Ridge National Laboratory Oak Ridge TN 37831 United States Inktank Inc. Los Angeles CA 90017 United States

ISBN: (纸本)9781450325059

Ceph is an emerging open-source parallel distributed file and storage system. By design, Ceph leverages unreliable commodity storage and network hardware, and provides reliability and fault-tolerance via controlled object placement and data replication. this paper presents our file and block I/O performance and scalability evaluation of Ceph for scientific high-performance computing (HPC) environments. Our work makes two unique contributions. First, our evaluation is performed under a realistic setup for a large-scale capability HPC environment using a commercial high-end storage system. Second, our path of investigation, tuning efforts, and findings made direct contributions to Ceph's development and improved code quality, scalability, and performance. these changes should benefit both Ceph and the HPC community at large. © 2013 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed Branch and Bound for the Permutation Flow Shop Problem

Scalable Distributed Branch and Bound for the Permutation Fl...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Univ Tunis Res Lab LaTICE ESSTT Tunis Tunisia

ISBN: (纸本)9780769550947

the study of the Permutation Flow Shop Problem (PFSP) is still of great interest in the community. Reducing the execution time of some very costly instances and/or solving new unresolved instances remain a challenge. the PFSP consists on scheduling n jobs in m machines with makespan criterion. Our approach to resolve this problem is based on a parallel distributed solution based on Branch and Bound method. In a previous work, we proposed a first algorithm called GAUUB that distributes the tasks among all processors while updating the new current better Upper Bound (UB). this algorithm GAUUB allowed us, in one hand, to reduce significantly the run times of several benchmark instances and on the other hand, to resolve new instances. In this work, we propose another version of this algorithm (called GALB) that improves the load balancing of tasks among the available processors. Our objective is to have all processors terminating at almost the same time and such that improving run time. In this paper, we will present detailed description of GALB as well as an exhaustive evaluation study based on the well known Taillard's Benchmarks and performed on the French national grid (Grid'5000).

关键词： Grid computing Permutation Flow Shop problem Branch and Bound load balancing

来源：评论

学校读者我要写书评

暂无评论

Energy Analysis of Hadoop Cluster Failure Recovery

Energy Analysis of Hadoop Cluster Failure Recovery

引用

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

作者： Xu, Weiyue Lu, Ying Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA

ISBN: (纸本)9781479924189

Energy efficiency is now used as an important metric for evaluating a computing system. However, saving energy is a big challenge due to many constraints. For example, in one of the most popular distributed processing frameworks, Hadoop, three replicas of each data block are randomly distributed in order to improve performance and fault tolerance. But such a mechanism limits the largest number of machines that can be turned off to save energy without affecting the data availability. To overcome this limitation, previous research introduces a new mechanism called covering subset which maintains a set of active nodes to ensure the immediate availability of data, even when all other nodes are turned off. this covering subset based mechanism works smoothly if no failure happens. However, a node in the covering subset may fail. In this paper, we study the energy-efficient failure recovery in Hadoop clusters. Rather than only using the replication as adopted by a Hadoop system by default, we investigate both replication and erasure coding as possible redundancy mechanisms. We develop failure recovery algorithms for both systems and analytically compare their energy efficiency.

关键词： Data transfer Decoding distributed databases Encoding Energy consumption Fault tolerance Fault tolerant systems Fault tolerant systems distributed databases Fault tolerance data transmission failure recovery DECODING energy consumption data availability Energy efficiency active nodes ENERGY ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：