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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,364 篇 工学
- 1,234 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

108 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,704 篇 英文
40 篇 其他
18 篇 中文
9 篇 俄文

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

共 1770 条记录，以下是1111-1120 订阅

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

详细简洁

排序：

An adaptive multi-agent approach for distributed alarm correlation and fault identification

An adaptive multi-agent approach for distributed alarm corre...

引用

9th IASTED international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Mohamed, Abduljalil A. Basir, Otman Department of Systems Design Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

ISBN: (纸本)9780889868205

Network fault management systems rely heavily on observed alarms to identify the root causes of network failures. Due to the increasing complexity of modern computer networks, the information carried by these alarms may in fact be vague, imprecise, and inconsistent. thus, these alarms often possess different diagnostic capabilities and should not be treated equally. In this paper, we propose a new distributed alarm correlation approach that effectively tackles the aforementioned data deficiencies. According to the proposed approach, the managed network is first divided into a disjoint set of management domains and each domain is assigned an intelligent agent. Within the framework of Dempster-Shafer evidence theory, the intelligent agent perceives each network entity in its domain as a source of information. As such, alarms emitted by these entities are expected to exhibit different information qualities and are assigned different weights accordingly. Based on their weights, the observed alarms are then correlated by their respective agent into a single local fuzzy composite alarm. Since local composite alarms constitute only partial views of the managed network, they are correlated, by a higher management entity, into a global alarm that accurately reflects a comprehensive view of the managed network.

关键词： Alarm systems

来源：评论

学校读者我要写书评

暂无评论

A platform-centric framework for the web exposure and orchestration of distributed objects

A platform-centric framework for the web exposure and orches...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Paulino, Hervé Cancela, Paulo Franco, Tiago CITI Departamento de Informática Universidade Nova de Lisboa Portugal Portugal Critical Software SA Portugal

ISBN: (纸本)9780769542874

Many of the current service-oriented architectures are built on top of distributed object technologies. these technologies have, however, lost most of their initial appeal, mainly due to the inability to port their concepts to the World Wide Web, and to provide interoperability across many different platforms. the porting of these distributed object platforms to the current Web Service standard is, however, a costly process that requires high investments of both time and money. this paper presents OHMS, a framework that provides an easy and not resource consuming way of exposing a platform to the Web, thus enabling Web access, business-to-business interaction and service composition, by the means of orchestration. We address the framework's architecture, its implementation, and the support for orchestrating CORBA platforms. We evaluate the work regarding the initial requirements, the effort required to support a given distributed object technology, and performance issues. We also address the application of OHMS to a real-life scenario. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Systematic development of correct Bulk Synchronous parallel programs

Systematic development of correct Bulk Synchronous Parallel ...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Gesbert, Louis Hu, Zhenjiang Loulergue, Frédéric Matsuzaki, Kiminori Tesson, Julien MLstate Paris France National Institute of Informatics Tokyo Japan LIFO Université d'Orléans France Kochi University of Technology Kochi Japan

ISBN: (纸本)9780769542874

With the current generalisation of parallel architectures arises the concern of applying formal methods to parallelism. the complexity of parallel, compared to sequential, programs makes them more error-prone and difficult to verify. Bulk Synchronous parallelism (BSP) is a model of computation which offers a high degree of abstraction like PRAM models but yet a realistic cost model based on a structured parallelism. We propose a framework for refining a sequential specification toward a functional BSP program, the whole process being done with the help of the Coq proof assistant. To do so we define BH, a new homomorphic skeleton, which captures the essence of BSP computation in an algorithmic level, and also serves as a bridge in mapping from high level specification to low level BSP parallel programs. © 2010 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

parallel point-addition and point-double for cryptosystem on conic curves over ring Zn

Parallel point-addition and point-double for cryptosystem on...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Li, Yongnan Xiao, Limin Liang, Aihua Wang, Zifeng State Key Laboratory of Software Development Environment Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9780769542874

Conic curves cryptosystem is a new technology for achieving information security. Point-addition and point-double are fundamental operations in conic curves cryptosystem over ring Zn. there is no existing research about the parallel computation for conic curves cryptosystem over ring Zn. this paper proposes parallel algorithms of point-addition and point-double for cryptosystem on conic curves over ring Zn. Additionally, we present a methodology to simplify the operation of computing greatest common factor by replacing it using two reduction operations in this cryptosystem. Research in this paper is based on our previous works about parallel algorithms for conic curves cryptosystem over finite field Fp. We design the parallel algorithms by analyzing basic multiple-precision algorithms used in these operations. the performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over ring Zn. © 2010 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Maotai 3.0: Automatic detection of view access in VOPP

Maotai 3.0: Automatic detection of view access in VOPP

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Leung, K. Huang, Z. Department of Computer Science University of Otago Dunedin New Zealand

ISBN: (纸本)9780769542874

this paper proposes a scheme for automatic detection of view access in the View-Oriented parallel Programming (VOPP) model. VOPP is a shared-memory-based, data-centric model that uses "views" to bundle mutual exclusion with data access. Based on the automatic detection scheme, a view is automatically acquired when first accessed, and automatically released at proper time. this scheme simplifies the VOPP model and prevents programming errors. With this scheme, the programmability of VOPP is similar to transactional memory models. In addition, VOPP can eliminate data races without compromising performance. A new VOPP implementation, Maotai 3.0, has been developed and incorporated the above features. Experimental results demonstrate that the performance of Maotai 3.0 surpasses transactional memory models such as TL-2. © 2010 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

An innovative hybrid P2P location network for distributed optimal path planning

An innovative hybrid P2P location network for distributed op...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Gao, Lei Zeng, Guangzhou School of Computer Science and Technology Shandong University Jinan Shandong China

ISBN: (纸本)9780769542874

the distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of distributed computing. the essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this problem, an innovative hybrid P2P location network consisting of spanning graph location network (SGLN) and workload balancing network (WBN) is proposed based on a novel variable length coding which encodes the logical relationship of workflow model. SGLN achieves one hop routing complexity with 100% location precision and zero extra routing bandwidth at a coarse granularity. And WBN realizes an optimal decentralized dynamic task scheduling at a fine granularity by constructing a randomized network which can keep stable topology and a heuristic random sampling with fast converge at the optimal peers. the combination of SGLN and WBN provides an optimal solution to the D-OPP problem and a novel cooperative computing paradigm to distributed computing. © 2010 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

HEPRA: History of encounters probabilistic routing algorithm in delay-tolerant network

HEPRA: History of encounters probabilistic routing algorithm...

引用

9th IASTED international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Alnajjar, Fuad Saadawi, Tarek City College and Graduate Center City University of New York Electrical Engineering Department 138th Street New York NY 10031 United States

ISBN: (纸本)9780889868205

Routing in mobile ad hoc networks (MANET) is complex and complicated because the network graph is episodically connected. the topology is changing rapidly because of weather, terrain, highly variable delay links, error rate links, and jamming. A key challenge is to create a method that can present good delivery performance and low end-to-end delay in an intermittent network graph and opportunistic or scheduled intermittent links where nodes may move freely. Delay-Tolerant Networking (DTN) architecture is designed to provide communication in intermittently connected networks by moving messages towards destination via 'store, carry and forward' technique that supports multi-routing algorithms to acquire best path towards destination. In this paper, we propose the use of probabilistic routing in DTN architecture using the concept of History of Encounters. We compared the new approach, History of Encounters Probabilistic Routing Algorithm (HEPRA) to the common DTN-based protocols. We have used the Opportunistic Network Environment (ONE) simulator as a simulation tool. We demonstrate the ability of HEPRA to accomplish good quality performance than the other common existing Protocols.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Commit protocols for a distributed transactional memory

Commit protocols for a distributed transactional memory

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Müller, Marc-Florian Möller, Kim-thomas Schöttner, Michael Institut für Informatik Heinrich-Heine-Universität Düsseldorf Universitätsstr. 1 40225 Düsseldorf Germany

ISBN: (纸本)9780769542874

Concurrency control in distributed and parallel applications has been studied for many years but is still an ongoing research topic. Transactional memory addresses this challenge for multicore processors by proposing to execute critical sections as restartable transactions combined with optimistic synchronization. thus the programmer has not to reason about complex lock management and deadlocks. We believe that some of these ideas are also useful for distributed systems. therefore, we are developing the Object Sharing Service (OSS) providing transparent data sharing for clusters and grids. OSS supports different consistency models for replica management within one application. In this paper we present the design and implementation of different transaction commit protocols for supporting transactional consistency. the main challenge of the resulting distributed transactional memory (DTM) is how to mask network latency allowing to commit transactions fast. Experiments with synthetic micro benchmarks and a MapReduce application on the Grid'5000 platform show that a DTM is efficiently providing strong consistency for shared data. © 2010 IEEE.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Transient congestion avoidance in software distributed shared memory systems

Transient congestion avoidance in software distributed share...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Costa, J.J. Cortes, T. Martorell, X. Bueno, J. Ayguade, E. Universitat Politècnica de Catalunya Barcelona Supercomputing Center Spain

ISBN: (纸本)9780769542874

OpenMP applications executed on top of software distributed shared memory (SDSM) systems show peaks in network traffic. In these scenarios, synchronization points are used to maintain memory consistency and improve performance, and network traffic is highly increased due to data being exchanged between different nodes in the system. this behaviour generates network congestion which may limit or degrade applications performance. In this paper we present a technique to avoid these peaks by sending data producing the congestion earlier in time. Our proposal is to introduce virtual synchronization points between the real ones, and use them to automatically distribute the network traffic. this technique is evaluated with a synthetic benchmark, and with the classes A and B of two OpenMP codes from the NAS benchmarks (BT and CG), on top of NanosDSM, a page-based DSM implementing sequential consistency. the results show a 16% performance improvement on average over the traditional methods. © 2010 IEEE.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

ADREA: A framework for adaptive resource allocation in distributed computing systems

ADREA: A framework for adaptive resource allocation in distr...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Hussin, Masnida Lee, Young Choon Zomaya, Albert Y. Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney NSW 2006 Australia

ISBN: (纸本)9780769542874

Large-scale distributed computing systems (LDCSs) can be best characterized by their dynamic nature particularly in terms of availability and performance. Typically, these systems deal with various types of jobs in many aspects, such as resource requirements, quality of service (QoS) and other temporal constraints. these diverse characteristics in both resources and jobs impose a great burden on scheduling and resource allocation. that is, inefficient resource allocation brings about poor resource utilization issues and often unreliable job execution. We present the ADaptive-REliable Allocation (ADREA) scheme, which attempts to ensure reliable job execution effectively exploiting heterogeneity in both resources and jobs using a novel clustering technique and a dynamic job migration policy. Specifically, ADREA intends to pave the way in producing better performance (e.g., response time, resource utilization) with reliable computation. Extensive simulations with varying processing capacities and different job arrival rates have been carried out to evaluate our scheme. the results demonstrate that the proposed scheme provides better performance over other algorithms as it significantly improves both job completion time and resource utilization. © 2010 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 108 109 110 111 112 113 114 115 116 117 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：