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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1020 条记录，以下是671-680 订阅

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

详细简洁

排序：

A resource-oriented grid meta-scheduler based on agents

A resource-oriented grid meta-scheduler based on agents

引用

international conference on parallel and distributed computing and Networks

作者： Sakamoto, Kentaro Sato, Hiroyuki Univ Tokyo Ctr Informat Technol Dept Frontier Informat Tokyo Japan

ISBN: (纸本)9780889866379

A computational Grid, as an emerging framework for providing globally distributed computing resources to our desktop, has been established as a new programming environment. In particular, a new Grid research for utilizing a large number of busy computers is indispensable for further development of Grid. In this paper, we concentrate on Grid scheduling problem. To cope with unstable availability, low reliability, and mixed operation policies that are still serious problems in metascheduling, we propose ASF, Agent-based Scheduling Framework whose idea is dual to the conventional metascheduling. ASF is composed of a single discreet metascheduler and a collection of autonomous agents attached to each computing resource manager. Each agent autonomously finds jobs to be processed, instead of being assigned a job to by a omnipotent metascheduler. We implement a prototype of ASF, and prove its effectiveness. Our experiment shows that the total elapsed time of job processing is reduced by 11%.

关键词： grid agent oriented computing job scheduling

来源：评论

学校读者我要写书评

暂无评论

Coordination of distributed proactive smart resources

Coordination of distributed proactive smart resources

引用

international conference on parallel and distributed computing and Networks

作者： Khriyenko, Oleksiy Univ Jyvaskyla Agora Ctr Ind Ontol Grp SF-40014 Jyvaskyla Finland

ISBN: (纸本)9780889866379

Recent expectations regarding a new generation of the Web strongly depend on a success of Semantic Web technology. Resource Description Framework (RDF)(1) is the basis for explicit and machine-readable representations of semantics of various Web resources and enables a framework for interoperability of future Semantic Web-based applications. However it has been pointed out that RDF is not suitable for describing highly dynamic and proactive resources (e.g. industrial devices, processes, etc.). Therefore, an appropriate extension of the existing RDF is necessary. This paper presents the Proactivity Layer of the Smart Resource in Semantic Web with the Resource Agent Behaviour definition. Process performance strategies and coordination methods of such proactive goal-driven resources are considered.

关键词： proactive resource coordination semantic web intelligent scheduling heterogeneous resources collaboration multi-agent environment

来源：评论

学校读者我要写书评

暂无评论

Modeling contention of giga-updates per second (GUPs) in three parallel programming paradigms

Modeling contention of giga-updates per second (GUPs) in thr...

引用

international conference on parallel and distributed computing and Networks

作者： Sameh, Ahmed El-Ghazawi, Tarek Yacoov, Yesha George Washington Univ Dept Elect & Comp Engn Washington DC 20052 USA Univ Maryland Dept Comp Sci Baltimore MD 21201 USA

ISBN: (纸本)9780889866379

In this paper we make use of the LoPC model, which is inspired by both the LogP/PG and BSP models but accounts for contention for message processing resources in parallel programming models to derive a general estimate of execution cost. We carry out this cost estimate analysis for three dominate programming models: message passing, shared memory and distributed shared memory. We analyze a typical application;GUPs written in these programming models that have irregular receiver-initiated synchronous communication. The LoPC estimate for this application is shown to be accurate when compared against measured values of runtime of actual empirical computations on an SGI O2000 multiprocessor machine.

关键词： LoPC LogP LogPG MPI OpenMP DSM queuing model

来源：评论

学校读者我要写书评

暂无评论

Version vectors based synchronization engine for mobile devices

Version vectors based synchronization engine for mobile devi...

引用

international conference on parallel and distributed computing and Networks

作者： Castro, Carlos Quiroz Pakkala, Timo Software and Application Technologies Laboratory Nokia Research Center FI-0045 Nokia Group P.O. Box 407 Finland

ISBN: (纸本)9780889866379

Current synchronization engines are mainly designed to reconcile data repositories between multiple clients and a central server on a star-like topology. A different approach is needed to achieve synchronization on peer-to-peer topologies where any node can be both client and server and updates may happen independently. Version vectors are one solution to the problem, ensuring global convergence of the datasets and providing straightforward conflict detection, while letting applications to control the conflict resolution semantics in their specific domain. In this paper an implementation of a synchronization engine for contact data in mobile devices using version vectors is presented. The engine is capable of optimistically synchronizing databases among many nodes in a peer-to-peer fashion.

关键词： distributed databases applications data management synchronization version vectors mobile computing

来源：评论

学校读者我要写书评

暂无评论

A high collusion-resistant approach to distributed privacy-preserving data mining

A high collusion-resistant approach to distributed privacy-p...

引用

international conference on parallel and distributed computing and Networks

作者： Urabe, Shintaro Wang, Jiahong Kodama, Eiichiro Takata, Toyoo Iwate Prefectural Univ Fac Software & Informat Sci 152-52 Sugo Takizawa Iwate 0200193 Japan

ISBN: (纸本)9780889866379

Data mining across different companies, organizations, online shops, or the likes is necessary so as to discover valuable shared patterns, associations, trends, or dependencies in their shared data. Privacy, however, is a concern. In many situations it is required that data mining should be conducted without any privacy being violated. In response to this requirement, this paper proposes an effective distributed privacy-preserving data mining approach called CRDM (Collusion-Resistant Data Mining). CRDM is characterized by its ability to resist the collusion. Let the number of sites participating in data mining be M. Unless the number of colluding sites is not less than M - 1, privacy cannot be violated. Results of both analytical and experimental performance study demonstrated the effectiveness of CRDM.

关键词： data mining preserving privacy distributed processing collusion-resistance

来源：评论

学校读者我要写书评

暂无评论

parallelism of double Divide and Conquer algorithm for singular value decomposition

Parallelism of double Divide and Conquer algorithm for singu...

引用

international conference on parallel and distributed computing and Networks

作者： Konda, Taro Tsuboi, Hiroaki Takata, Masami IIwasaki, Masashi Nakamura, Yoshimasa Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Sakyo Ku Yoshida Honmachi Kyoto Japan Nara Womens Univ Grad Sch Humanity & Sci Nara Japan JST SORST Osaka Japan

ISBN: (纸本)9780889866379

This paper presents some numerical evaluations of parallel double Divide and Conquer for singular value decomposition. For eigenvalue decomposition and singular value decomposition, double Divide and Conquer was recently proposed. It rst computes eigen/singular values by a compact version of Divide and Conquer. The corresponding eigen/singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer are as good or even better than standard algorithms such as QR and the original Divide and Conquer. In addition, it is expected that double Divide and Conquer has great parallelism because each step is theoretically parallel and heavy communication is not required. This paper numerically evaluates a parallel implementation of dDC with MPI on some large scale problems using a distributed memory architecture and a massively parallel super computer, especially in terms of parallelism. It shows high scalability and super linear speed-up is observed in some cases.

关键词： parallel computing singular value decomposition eigenvalue decomposition numerical algorithm linear algebra

来源：评论

学校读者我要写书评

暂无评论

An efficient sparse matrix-vector multiplication on distributed memory parallel computers

An efficient sparse matrix-vector multiplication on distribu...

引用

iasted international conference on parallel and distributed computing and Networks, PDCN 2007

作者： Shahnaz, Rukhsana Usman, Anila Chughtai, Imran R. Islamabad Pakistan

ISBN: (纸本)9780889866379

The matrix-vector product is one of the most important computational components of Krylov methods. This kernel is an irregular problem, which has led to the development of several compressed storage formats. We design a data structure for distributed matrix to compute the matrix-vector product efficiently on distributed memory parallel computers using MPI. We conduct numerical experiments on several different sparse matrices and show the parallel performance of our sparse matrix-vector product routines.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Full-speed scalability of the pdomus platform for dhts

Full-speed scalability of the pdomus platform for dhts

引用

international conference on parallel and distributed computing and Networks

作者： Rufino, Jose Pina, Antonio Alves, Albano Exposto, Jose Lopes, Rui Polytech Inst BR-5300854 Braganca Paulista SP Brazil Univ Minho P-4719 Braga Portugal

ISBN: (纸本)9780889866379

Domus is an architecture for distributed Hash Tables (DHTs) tailored to a shared-all cluster environment. Domus DHTs build on a (dynamic) set of cluster nodes;each node may perform routing and/or storage tasks, for one or more DHTs, as a function of the node base (static) resources and of its (dynamic) state. Domus DHTs also benefit from a rich set of user-level attributes and operations. pDomus is a prototype of Domus that creates an environment where to evaluate the architecture concepts and features. In this paper, we present a set of experiments conduced to obtain figures of merit on the scalability of a specific DHT operation, with several lookup methods and storage technologies. The evaluation also involves a comparison with a database and a P2P-oriented DHT platform. The results are promising, and a motivation for further work.

关键词： cluster computing distributed hash tables evaluation

来源：评论

学校读者我要写书评

暂无评论

Automated distributed simulation in ptolemy II

Automated distributed simulation in ptolemy II

引用

international conference on parallel and distributed computing and Networks

作者： Cuadrado, Daniel Lazaro Ravn, Anders P. Koch, Peter Aalborg Univ Niels Jernes Vej 12 Aalborg 9220 Denmark

ISBN: (纸本)9780889866379

Despite the well known advantages of distributed processing for intensive computations like simulation, frameworks often fail to exploit them. A distributed simulation is harder to develop than a sequential one, because it is necessary to interface and map activities to processors and handle the ensuing communication and synchronization problems. Very often the designer has to explicitly specify extra information concerning distribution for the framework to make an effort to exploit parallelism. This paper presents Automated distributed Simulation (ADS), which allows the designer to forget about distribution concerns while benefiting from the advantages. ADS relies on the actor formalism. It is realized as an open source implementation for the Ptolemy II simulation framework. Experiments compare different topologies, granularities and number of blocks, achieving linear speedups for practical cases. We implement pipelining techniques so iterative models with purely sequential topologies can benefit from ADS.

关键词： distributed processing automatic deployment simulation actor Ptolemy speedup

来源：评论

学校读者我要写书评

暂无评论

Toward more parallel frequent itemset mining algorithms

Toward more parallel frequent itemset mining algorithms

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Kessl, Robert Tvrdík, Pavel Department of Computer Science and Engineering Faculty of Electrical Engineering Czech Technical University Prague Czech Republic

ISBN: (纸本)9780889867048

This paper presents improvements of the parallel-FIMI method for statical load balancing of mining of all frequent itemsets on a distributed-memory (DM) parallel machine. This method probabilistically partitions the space of all frequent itemsets into partitions of approximately the same size. The improvements consist in paralelization of the approximate partitioning of the search space and of dynamic reordering of items during construction of prefix-based equivalence classes. The new versions of the method achieve nearly linear speedups up to 10 processors.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：